24 人解决，62 人已尝试。
31 份提交通过，共有 136 份提交。
6.3 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
Suppose you have a physical balance(the kind where you can place weights on b1oth sides ) lets say you have weights 1,2 and 5. Using these weights you can measure all 1,2,3,4,5,6,7,8 kg weights where we measure 4 = 5-1 i.e. you place 5 kg weight on one side and 1 kg weight on the side where the thing to be weighed is kept. Now you can measure all weights from 1 to 8 using just 3 weights. This in fact is the least number of weights to do this. You will be given a number n as input and you have to output a number w,is least no of weights to measure all quantities weighing from 1 to n kgs.
First Line contains an integer t,is the number of test cases
There will be t test cases following, one per line.
Each Test case input consists of one integer n < 1000000.
For every test case, output an integer which denotes minimum number of weights required one on new line
2 8 10