Gold Rush



Description

Input

Output

Sample Input

3
2 2 2
2 1 3
10 1000 24

Sample Output

1
2
7

HINT

Source

贪心算法，注意变量在作用域中值的变化

#include<iostream>

#include<math.h>

using namespace std;

main()

{

int t,n;

scanf("%d",&t);

long long a,b,tmp;

while(t--)

{

scanf("%d%lld%lld",&n,&a,&b);

long long sum=1,qun=0;

for(int i=0;i<n;i++)

sum=2*sum;

a=max(a,b);

// printf("%lld %lld\n",a,sum);

if(a==sum)

{

printf("0\n");

continue;

}

while(a>0)

{

tmp=sum/2;

sum=tmp;

if(a>=tmp)

a=a-tmp;

qun++;

}

printf("%lld\n",qun);

}

}