C. Board Moves

藤蔓疯长

已于 2022-07-18 12:36:00 修改

阅读量138

点赞数 2

分类专栏： codeforce 文章标签： c++

于 2022-07-18 12:35:34 首次发布

本文链接：https://blog.csdn.net/qq_62079079/article/details/125846400

版权

codeforce 专栏收录该内容

87 篇文章 1 订阅

订阅专栏

Problem - C - Codeforces

You are given a board of size n×nn×n, where nn is odd (not divisible by 22). 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)(i,j) you can move the figure to cells:

(i−1,j−1)(i−1,j−1);
(i−1,j)(i−1,j);
(i−1,j+1)(i−1,j+1);
(i,j−1)(i,j−1);
(i,j+1)(i,j+1);
(i+1,j−1)(i+1,j−1);
(i+1,j)(i+1,j);
(i+1,j+1)(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−1n2−1 cells should contain 00 figures and one cell should contain n2n2 figures).

You have to answer tt independent test cases.

Input

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

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

It is guaranteed that the sum of nn over all test cases does not exceed 5⋅1055⋅105 (∑n≤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

Copy

output

Copy

0
40
41664916690999888

发现规律了；

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        ll n,num=0;
        cin>>n;
        for(ll i=1,k=8;i<=n/2;i++,k+=8)//i一定开long long
        {
        	num+=i*k;
        }
        cout<<num<<endl;
    }
    return 0;
}