1731B - Kill Demodogs - CodeForces Solution

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define int long long
int MOD = 1e9 + 7;
#define MAX 200005

// find_by_order()
// order_of_key()
// store duplicates set int to pair<int, int>
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    PBDS;

bool cmp(pair<int, int> a, pair<int, int> b){
    return a.first < b.first;
}


signed main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int t;
    cin >> t;

    while(t--){

        int n;
        cin >> n;

        int ans=((((n * (n+1)) % MOD) * ((4*n)-1)) % MOD * 337) % MOD;
        cout << ans << endl;
    }

    return 0;
}