Problem of the day
The first line contains a single integer ‘T’ representing the number of test cases.
The first line of each test case will contain two integers ‘N’ and ‘K’ where ‘N’ denotes the number whose 0 to ‘K’th bits have to be set and ‘K’ indicates the limit upto where from 0th bit, the bits have to be set.
For each test case, print the number after 0 to Kth bits are set.
Output for every test case will be printed in a separate line.
You don’t need to print anything; It has already been taken care of.
Can you solve this using O(1) time and space complexity?
1 <= T <= 10
-10^9 <= N <= 10^9
1 <= K <= 31
Time limit: 1 sec
2
5 2
16 3
7
23
In the first test case, we have the number ‘N’ as 5 (101) and K=2. Thus after set 2 bits from the right, the answer will be 7 (111).
In the second test case, we have the number ‘N’ as 16 (10000) and K=3. Thus after set 3 bit from right, the answer will be 23 (10111).
2
10 1
34 4
11
47
In the first test case, we have the number ‘N’ as 10 (1010) and K=1. Thus after set 1 bit from right, the answer will be 11 (1011).
In the second test case, we have the number ‘N’ as 32 (100010) and K=4. Thus after set 3 bit from the right, the answer will be 47 (101111).