B. Kill Demodogs codeforces solution in c++ || Codeforces Round #841 (Div. 2) and Divide by Zero 2022

 B. Kill Demodogs

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Demodogs from the Upside-down have attacked Hawkins again. El wants to reach Mike and also kill as many Demodogs in the way as possible.

Hawkins can be represented as an n×n$n\times n$ grid. The number of Demodogs in a cell at the i$i$-th row and the j$j$-th column is i⋅j$i\cdot j$. El is at position (1,1)$(1,1)$ of the grid, and she has to reach (n,n)$(n,n)$ where she can find Mike.

The only directions she can move are the right (from (i,j)$(i,j)$ to (i,j+1)$(i,j+1)$) and the down (from (i,j)$(i,j)$ to (i+1,j)$(i+1,j)$). She can't go out of the grid, as there are doors to the Upside-down at the boundaries.

Calculate the maximum possible number of Demodogs ans$\mathrm{a}\mathrm{n}\mathrm{s}$ she can kill on the way, considering that she kills all Demodogs in cells she visits (including starting and finishing cells).

Print 2022⋅ans$2022\cdot \mathrm{a}\mathrm{n}\mathrm{s}$ modulo 109+7${10}^9+7$. Modulo 109+7${10}^9+7$ because the result can be too large and multiplied by 2022$2022$ because we are never gonna see it again!

(Note, you firstly multiply by 2022$2022$ and only after that take the remainder.)

Input

Each test contains multiple test cases. The first line contains the number of test cases t$t$ (1≤t≤104$1\le t\le {10}^4$). Description of the test cases follows.

The first line of each test case contains one integer n$n$ (2≤n≤109$2\le n\le {10}^9$) — the size of the grid.

Output

For each test case, print a single integer — the maximum number of Demodogs that can be killed multiplied by 2022$2022$, modulo 109+7${10}^9+7$.

code of this question --- 

void solve()

{  

  int n;

  cin >> n;

  int ans = 2022/6;

  ans*=n;

  ans%=Mod;

  ans*=n+1;

  ans%=Mod;

  ans*=4*n-1;

  ans%=Mod;

  cout<<ans<<nline;

  

}