BITPLAY  PLAYING WITH BITS
The problem is very simple.
You are given a even number N and an integer K and you have to find the greatest odd number M less than N such that the sum of digits in binary representation of M is atmost K.
Input
For each testcase, you are given an even number N and an integer K.
Output
For each test case, output the integer M if it exists, else print 1.
Constraints
1 <= T <= 10^4
2 <= N <= 10^9
0 <= K <= 30
Example
Input: 2 10 2 6 1 Output: 9 1
Explanation
First case when N = 10, K = 2
Binary representaion of 10 is 1010 and binary representation of 9 is 1001, hence greatest odd number less than 10 whose sum of digits in its binary representation is atmost 2 is 9. Hence output is 9
hide comments
iamgenius:
20180811 21:55:08
I feel so confident solving it without the bitset library lol 

flyingduchman_:
20180410 19:41:54
/***


Simes:
20171023 11:55:09
Last edit: 20171023 12:38:36 

viratian_070:
20170704 11:44:52
bitset rocks!!...dont forget that 1 

aditya930:
20170603 23:30:07
use bitset libraray functions


warriorwithin:
20170509 18:04:19
very easy logic ;P 

vengatesh15:
20170201 20:40:10
nice problem learnt bitset library 

praney_rai:
20161223 07:13:33
poor 1 costed me 2 wa... anyways nice question... 

shubham2305:
20160811 12:29:09
"Atmost k "


mkfeuhrer:
20160607 22:45:10
nice problem

Added by:  tapariaankit 
Date:  20150822 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU JSMONKEY 