HDU 5747

Aaronson

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

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
  
  

 

Source

BestCoder Round #84

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5751  5749  5748  5746  5745 

转化为2进制，每个数位加起来就行

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;


int main()
{
    int t;
    long long m,n;
    cin>>t;
    while(t--){
        cin>>n>>m;
        long long ans=0;
        while(m--&&n){
            ans+=n%2;
            n/=2;
        }
        cout<<ans+n<<endl;
    }
}