Codeforces Round #642 (Div. 3)

C题：Board Moves

You are given a board of size n×n, where n is odd (not divisible by 2). Initially, each cell of the board contains one figure.

In one move, you can select exactly one figure presented in some cell and move it to one of the cells sharing a side or a corner with the current cell, i.e. from the cell (i,j) you can move the figure to cells:

(i−1,j−1);
(i−1,j);
(i−1,j+1);
(i,j−1);
(i,j+1);
(i+1,j−1);
(i+1,j);
(i+1,j+1);
Of course, you can not move figures to cells out of the board. It is allowed that after a move there will be several figures in one cell.

Your task is to find the minimum number of moves needed to get all the figures into one cell (i.e. n2−1 cells should contain 0 figures and one cell should contain n2 figures).

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤200) — the number of test cases. Then t test cases follow.

The only line of the test case contains one integer n (1≤n<5⋅105) — the size of the board. It is guaranteed that n is odd (not divisible by 2).

It is guaranteed that the sum of n over all test cases does not exceed 5⋅105 (∑n≤5⋅105).

Output
For each test case print the answer — the minimum number of moves needed to get all the figures into one cell.

Example
input
3
1
5
499993
output
0
40
41664916690999888
题意：就是输入奇数n，格子大小为n*n的，反正就求每空到最中心的距离的和这个距离呢就是跟那个圆的半径一样来看就行了
思路：这个题自己浪费时间太多了，可惜自己没把他们存到数组里面。
其实挺简单的
增增递进要记住
每次光算最外圈的就行了。

等于4*(n-1)*i 这个i就是最外圈的半径 i=n/2;
就行了

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<vector>
using namespace std;
#define inf 0x3f3f3f3f3f;
typedef long long ll;
ll b[500001];
int main()
{
	int t; cin >> t;
	for (ll i = 3; i <= 500001; i = i + 2)
	{
		b[i] = (i-1)*4*(i/2);
		b[i] += b[i - 2];
	}
	while (t--)
	{
		ll n; cin >> n;
		cout << b[n] << endl;
	
	}
}