Since Grisha behaved well last year, at New Year's Eve he was visited by Ded Moroz who brought an enormous bag of gifts with him! The bag contains n sweet candies from the good ol' bakery, each labeled from 1 to n corresponding to its tastiness. No two candies have the same tastiness.
The choice of candies has a direct effect on Grisha's happiness. One can assume that he should take the tastiest ones — but no, the holiday magic turns things upside down. It is the xor-sum of tastinesses that matters, not the ordinary sum!
A xor-sum of a sequence of integers a1, a2, ..., am is defined as the bitwise XOR of all its elements: , here
denotes the bitwise XOR operation; more about bitwise XOR can be found here.
Ded Moroz warned Grisha he has more houses to visit, so Grisha can take no more than k candies from the bag. Help Grisha determine the largest xor-sum (largest xor-sum means maximum happiness!) he can obtain.
The sole string contains two integers n and k (1 ≤ k ≤ n ≤ 1018).
Output one number — the largest possible xor-sum.
4 3
7
6 6
7
In the first sample case, one optimal answer is 1, 2 and 4, giving the xor-sum of 7.
In the second sample case, one can, for example, take all six candies and obtain the xor-sum of 7.
1-n个数当中选择不多于K个数,要求他们异或值最大,求那个最大值。
K=1是肯定就是n。
k>1时我们只需要选择两个,就可以保证异或最大。 第n个,和与第n个互补的那一个。 他们两个异或可以得到1111.保证最大
#include <iostream>
using namespace std;
int main()
{
long long n,k;
cin>>n>>k;
if(k==1)
cout<<n<<endl;
else
{
long long ans=1;
while(1)
{
if(ans>n)
break;
ans*=2;
}
cout<<ans-1<<endl;
}
}