Segment Tree
时间限制: 1 Sec 内存限制: 512 MB
提交: 107 解决: 23
[提交] [状态] [命题人:admin]
题目描述
Mcginn opens the code which he wrote 25 years ago.
Clever Mcginn wants to know how many positive interger n satisfied that the maximum c can reach whencall function build(1 , 1 , n) in the main function is m.
There are T test cases. Each case contains one integer m.
输入
Input is given from Standard Input in the following format:
T
m1
m2
.
.
.
mT
Constraints
1 ≤ T ≤ 100
1 ≤ m ≤ 1018</