poj1455——Crazy tea party

#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
void solve(int n,int t)
{
int i,len=n/2,sum=0;
int step,st;
for(i=1;i<=len;i++)
{
int m=n+1-i;//对应位置
step=m-i-1+m-i;
st=m-i-1+(n-m)+i-1;
step=step<st?step:st;
st=i-1+n-m+m-i-1;
step=step<st?step:st;
st=i-1+n-m+1+n-m+i-1;
step=step<st?step:st;
sum+=step;
}
cout<<sum<<endl;
}
int main()
{
int test,n;
cin>>test;
while(test--)
{
cin>>n;
if(n%2!=0)
solve(n,1);
else solve(n,0);
}
return 0;
}