Codeforces Round #456 (Div. 2) ——B. New Year's Eve（思路）

CF2018年的第一场比赛，这也是我第一次打CF，发现挺有意思的。

本人太弱只能去写写签到题，B题以为是搜索或者贪心卡了好久，1个小时过去了才发现有规律，一发Pretest Passed，然后一直没人hack以为稳了。比赛结束竟然FST了 (⋟﹏⋞)，查看源代码发现竟然是少输入了一个值ORZ，感觉自己像个智障，好像本来就是。

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.

题意就是1-n的整数任取k个数进行异或得到最大值。

思路：

将1-n以2进制列出，不难发现除了k为1输出n以外，总能凑到n二进制最高位1所在之后全为1的情况（表述能力太差）。

举个例子 9二进制为1001，最高位1所在之后全为1，即1111，就是2^4-1。

代码：

#include<stdio.h>
#define ll long long

int main(){
    ll n,m,ans=1;
    scanf("%lld%lld",&n,&m);
    if(m==1)printf("%lld\n",n);
    else {
        while(ans<<=1,n>>=1);
        printf("%lld\n",ans-1);
    }
    return 0;
}