Codeforces #642 div3 C
原题链接
思路:模拟
ACcodes:
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
long long inf = 0x3f3f3f3f3f3f3f3f;
int test = 1;
long long n,a[N];
long long res;
int main()
{
scanf("%d",&test);
while(test--)
{
res = 0;
cin >> n;
for(long long i=1;i<=n;i+=2)
res+=(4*i-4)*(i/2);
cout << res << endl;
}
return 0;
}