CF1840B

题目描述

Once upon a time, Toma found himself in a binary cafe. It is a very popular and unusual place.

The cafe offers visitors kk different delicious desserts. The desserts are numbered from 0to k−1 . The cost of the i -th dessert is 2^i coins, because it is a binary cafe! Toma is willing to spend no more than nn coins on tasting desserts. At the same time, he is not interested in buying any dessert more than once, because one is enough to evaluate the taste.

In how many different ways can he buy several desserts (possibly zero) for tasting?

输入格式

The first line of the input contains a single integer t ( 1≤t≤1000 ) — the number of test cases.

Then follows t lines, each of which describes one test case.

Each test case is given on a single line and consists of two integers n and k ( 1≤n,k≤10^9) — the number of coins Toma is willing to spend and the number of desserts in the binary cafe.

输出格式

Output t integers, the i-th of which should be equal to the answer for the i-th test case — the number of ways to buy desserts for tasting.

输入样例

5
1 2
2 1
2 2
10 2
179 100

输出样例

2
2
3
4
180

说明/提示

Variants for 1st sample: {}, {1}
Variants for 2nd sample: {}, {1}
Variants for 3rd sample: {}, {1}, {2}
Variants for 4th sample: {}, {1}, {2}, {1, 2}

分析

甜品的编号是从0开始的，所以第0号甜品花费的硬币为1硬币，第1个甜品为2个硬币，第2个甜品为4个硬币，
所以如果有n个甜品全部都尝试花费总的硬币数为2^n-1，三个甜品总共花费的硬币为7个，正好是2的3次方-1，这就是二进制的一个特性，2的n次方-1，就等于2的0次方+2的1次方…+2的n-1次方。

如果硬币的数量大于2^k-1，那就说明所有的尝甜品的方式都能满足，如果小于等于2的k次方-1，只能尝试n种方式。从1到n转化成2进制数，位置上是1的尝试，是0的不尝试，总共n种尝试方式。

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long t,n,k,tmp;
	cin>>t;
	while(t--)
	{
		cin>>n>>k;
		
		if(k>=30||n<=pow(2,k)-1)
			cout<<n+1<<endl;
		else
			cout<<(int)pow(2,k)<<endl;//pow(2,k)前面如果不加int就会报错,在计算的过程中结果越界。	
	}
	return 0;	
 } 

如果使用(1<<k)代替pow(2,k) ，就不会存在这个问题了，它是移位的方式不存在越界

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long t,n,k,tmp;
	cin>>t;
	while(t--)
	{
		cin>>n>>k;
		
		if(k>=30||n<=(1<<k)-1)//使用(1<<k)代替pow(2,k) 
			cout<<n+1<<endl;
		else
			cout<<(1<<k)<<endl;	//pow(2,k)前面如果不加int就会报错？ 
	}
	return 0;	
 }