Magical Sticks 棍子拼接

A penguin Rocher has n sticks. He has exactly one stick with length i for all 1≤i≤n. He can connect some sticks. If he connects two sticks that have lengths a and b, he gets one stick with length a+b. Twosticks, that were used in the operation disappear from his set and thebnew connected stick appears in his set and can be used for the next connections. He wants to create the maximum number of sticks that have the same length. It is not necessary to make all sticks have the same length, some sticks can have the other length. How many sticks with the equal length he can create?

Input

The input consists of multiple test cases. The first line contains a single integer t (1≤t≤1000) — the number of test cases. Next t lines contain descriptions of test cases For each test case, the only line contains a single integer n (1≤n≤109).

Output

For each test case, print a single integer — the answer to the
problem.

Example Input

4
1
2
3
4

Output

1
1
2
2

Note

In the third case, he can connect two sticks with lengths 1 and 2 and he will get one stick with length 3. So, he will have two sticks with lengths 3. In the fourth case, he can connect two sticks with lengths 1 and 3 and he will get one stick with length 4. After that, he will have three sticks with lengths {2,4,4}, so two sticks have the same length, and one stick has the other length.

簡單分析一下思路
比如 5:1 2 3 4 5
有兩種情況 1和5 2和4
也就是往中間靠就行了
偶數n/2；奇數n+1/2

#include<bits/stdc++.h> using namespace std; int main() {int n, t;cin >> t;while (t--){cin >> n;cout << (n + 1) / 2 << endl;}return 0; } 與50位技術專家面對面20年技術見證，附贈技術全景圖

總結

以上是生活随笔為你收集整理的Magical Sticks 棍子拼接的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。