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).
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个人在桌子上围成一圈坐下,每次每分钟交换两人,最后使一圈人变成原来的逆序,比如12345(1)变成54321(5)。
做法是讲原数组分为两部分,左边的一部分用类似冒泡的办法,调转过来,右边也是
12345--->123 | 45
132 | 45
312 | 45
321 | 45
321 | 54
#include<iostream>
using namespace std;
int main()
{
int cases;
cin >> cases;
while (cases--)
{
int n = 0;
cin >> n;
cout << n / 2 * (n / 2 - 1) / 2 + (n + 1) / 2 * ((n + 1) / 2 - 1) / 2<<endl;
}
}