BestCoder Round #841001Aaronson

Aaronson

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 684    Accepted Submission(s): 383

Problem Description

Recently, Peter saw the equation x0+2x1+4x2+...+2mxm=n . He wants to find a solution (x0,x1,x2,...,xm) in such a manner that ∑i=0mxi is minimum and every xi ( 0≤i≤m ) is non-negative.

 

Input

There are multiple test cases. The first line of input contains an integer T (1≤T≤105) , indicating the number of test cases. For each test case:

The first contains two integers n and m (0≤n,m≤109) .

 

Output

For each test case, output the minimum value of ∑i=0mxi .

 

Sample Input

  
  

   
   10
1 2
3 2
5 2
10 2
10 3
10 4
13 5
20 4
11 11
12 3
  
  

 

Sample Output

  
  

   
   1
2
2
3
2
2
3
2
3
2
  
  
  
  


  
  

 思路： 看到2..想到二进制，就是把一个数用有限二进制位数表示，超过的另加；

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>

using namespace std;

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,m;
        cin>>n>>m;
        int ans = 0;
        for(int i = 0; n&&i <= m ; i++)
        {
            if(n%2 != 0)                      //是1 则++。
                ans++;
            n /= 2;                             //看下一位
        }
        ans += n*2;                           //超过有限位数的另算；
        cout<<ans<<endl;
    }
}