import sys
n, k = map(int, input().split())
if k == 1:
print(n)
sys.exit(0)
ans = 1
while ans < n:
ans = ans * 2 + 1
print(ans)// Online C++ compiler to run C++ program online
#include <iostream>
using namespace std;
int main() {
long long count=1;
long long n,k;
cin>>n>>k;
long long old=n;
while((n>>1)!=0){
count++;
n=n>>1;
}
// cout<<count<<endl;
long long num=1;
for(long long i=1;i<count;i++){
num=(num<<1)^1;
}
if(k==1)cout<<old<<endl;
else cout<<num<<endl;
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |