Codeforces Round #456 (Div. 2) B. New Year's Eve 贪心、构造、位运算、异或和

B. New Year's Eve

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

The sole string contains two integers n and k (1 ≤ k ≤ n ≤ 1018).

Output

Output one number — the largest possible xor-sum.

Examples

input

4 3

output

7

input

6 6

output

7

Note

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.

Source

Codeforces Round #456 (Div. 2)

My Solution

题意：给出1~n这n个数，最多选k个数，要求，选出的数的异或和最大，求这个异或和。

贪心、构造、位运算、异或和

首先对于n的二进制有b位，n ^ ((1<<b) - 1)的值必定小于n。

所以如果k为1，则只能选ans = n；

否则选n和n ^ ((1<<b) - 1)这2个数，当n和 ((1<<b) - 1)相等时依然选n，即 ans = (1<<b) - 1。

#include <iostream>
#include <cstdio>

using namespace std;
typedef long long LL;
const int MAXN = 1e6 + 8;


int main()
{
    #ifdef LOCAL
    freopen("b.txt", "r", stdin);
    //freopen("b.out", "w", stdout);
    int T = 4;
    while(T--){
    #endif // LOCAL
    ios::sync_with_stdio(false); cin.tie(0);

    LL n, k, ans = 0;
    cin >> n >> k;
    if(k == 1) cout << n << endl;
    else{
        while(n){
            ans <<= 1ll;
            ans |= 1ll;
            n >>= 1ll;
        }
        cout << ans << endl;

    }



    #ifdef LOCAL
    cout << endl;
    }
    #endif // LOCAL
    return 0;
}

  Thank you！

                                                                                                                                             ------from ProLights