태터데스크 관리자

도움말
닫기
적용하기   첫페이지 만들기

태터데스크 메시지

저장하였습니다.
블로그 이미지
Lonewolf dlbo

calendar

  1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 31      

Notice

Crazy tea party
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 4055 Accepted: 2736

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

Source

'PKU & UVa problems > Original problem' 카테고리의 다른 글

PKU 2039. To and Fro  (0) 2009.03.25
UVa 324. Factorial Frequencies  (0) 2009.03.17
PKU 1455. Crazy Tea Party  (2) 2009.02.25
PKU 2719. Faulty Odometer  (0) 2009.02.16
UVa 200. Rare Order  (0) 2009.02.07
PKU 2551. Ones  (0) 2009.01.21
posted by Sparking