Crazy tea party

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=31675#problem/N

任意選定一個數值，那麼無論怎麼移動至少要移動n/2步;然後在剩下的n-1個人中同樣任意取一個值，同樣需要移動( n - 1 ) / 2 ;

// File Name: uvala2756.cpp// Author: bo_jwolf// Created Time: 2013年09月24日 星期二 17:16:29#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>using namespace std;int main(){int n , Case ;scanf( "%d" , &Case ) ;while( Case-- ){scanf( "%d" , &n ) ;printf( "%d\n" , ( n / 2 ) * ( ( n - 1 ) / 2 ) ) ;}return 0;}