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 棍子拼接的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。