Javabeans

点击打开链接

-Javabeans

Crawling in process...Crawling failed

Time Limit:2000MS    Memory Limit:65536KB    64bit IO Format:%lld & %llu

SubmitStatus

Description

Javabeans are delicious. Javaman likes to eat javabeans very much.

Javaman has n boxes of javabeans. There are exactly i javabeans in thei-th box (i = 1, 2, 3,...n). Everyday Javaman chooses an integerx. He also chooses several boxes where the numbers of javabeans are all at leastx. Then he eats x javabeans in each box he has just chosen. Javaman wants to eat all the javabeans up as soon as possible. So how many days it costs for him to eat all the javabeans?

Input

There are multiple test cases. The first line of input is an integer T ≈ 100 indicating the number of test cases.

Each test case is a line of a positive integer 0 < n < 2³¹.

Output

For each test case output the result in a single line.

Sample Input

41234

Sample Output

1223

#include<stdio.h>#include<math.h>int sum;int log2(int x){int sum=0;while(x>>=1){sum++;}return sum;}int main(){    int m;    while(scanf("%d",&m)!=EOF)    {        while(m--)        {            int n;            scanf("%d",&n);            log2(n);            printf("%d\n",sum);        }    }    return 0;}