ZOJ 3498 Javabeans【规律】

Javabeans

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

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

Javaman has n boxes of javabeans. There are exactly i javabeans in the i-th box (i = 1, 2, 3,...n). Everyday Javaman chooses an integer x. He also chooses several boxes where the numbers of javabeans are all at least x. 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

4
1
2
3
4

Sample Output

1
2
2
3

 
 


 
 
 不断二分，使规模减小一半，一直进行此操作，到所有盒子的球为0为止
例如：1 2 3 4 5 6 7 → 1 2 3 0 1 2 3 →1 0 1 0 1 0 1 →0 0 0 0 0 0 0

      1 2 3 4 5 6 7 8 → 1 2 3 4 0 1 2 3 → 1 0 1 2 0 1 2 1 → 1 0 1 1 0 1 1 1 → 0 0 0 0 0 0 0 0

#include<cstdio>
#include<math.h>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
#define abs(x) (x>0?x:-x)
const int INF=0x7ffffff;
const int M=15000;
const ll MAX=1e18;

ll n;

int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
     scanf("%ld",&n);
     ll sum=0;
     while(n/2>0){
            sum++;
            n/=2;
     }
      printf("%ld\n",sum+1);
    }
    return 0;
}

Javabeans

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

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

Javaman has n boxes of javabeans. There are exactly i javabeans in the i-th box (i = 1, 2, 3,...n). Everyday Javaman chooses an integer x. He also chooses several boxes where the numbers of javabeans are all at least x. 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

4
1
2
3
4

Sample Output

1
2
2
3