ZOJ.1730 Crazy Tea Party 2015/09/22

最新推荐文章于 2017-07-15 09:00:56 发布

hdweilao

最新推荐文章于 2017-07-15 09:00:56 发布

阅读量239

点赞数 1

分类专栏： ZOJ（浙大）

本文链接：https://blog.csdn.net/hdweilao/article/details/48654111

版权

ZOJ（浙大）专栏收录该内容

30 篇文章 0 订阅

订阅专栏

Crazy Tea Party

Time Limit: 2 Seconds Memory Limit: 65536 KB

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

Source: Southeastern Europe 2003

f(n) = (n/2)*((n-1)/2)，杭电上有道一样的题，我用数组过的，但是这里就过不了，不知为什么？？？

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

int main(){
    int n,t;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        printf("%d\n",(n/2)*((n-1)/2));
    }
    return 0;
}