《Crazy tea party》

Description

 

n participants of �crazy tea party� sit around the table. Each minute one pair of neighbors can change their places. Find the minimum time (in minutes) required for all participants to sit in reverse order (so that left neighbors would become right, and right - left).

Input

The first line is the amount of tests. Each next line contains one integer n (1 <= n <= 32767) - the amount of crazy tea participants.

Output

For each number n of participants to crazy tea party print on the standard output, on a separate line, the minimum time required for all participants to sit in reverse order.

Sample Input

3
4
5
6

Sample Output

2
4
6

 题意：n个人顺时针围成一个圈;

　　　欲将其按逆时针围成圈;

　　　每次只能移动一对相邻的人;

　　　问至少需要移动多少次;

题解：由于这是一个环;

　　　将其折中取半来移动;

　　　最后便能使步骤最少;

代码：

　　

#include <stdio.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>

using namespace std;

int main()
{
   // freopen("ACM.txt","r",stdin);
    int t,n;
    cin>>t;
    while(t--)
    {
        int ans=0;
        cin>>n;
        int x=n/2;
        for(int i=1;i<=x;i++)
        {
            ans+=x-i;
        }
        for(int i=x+1;i<=n;i++)
        {
            ans+=n-i;
        }
        cout<<ans<<endl;
    }
}