Given two numbers n and k, we need to find the minimum number of flips required to maximize given number by flipping its bits such that the resulting number has exactly k set bits.
Note : K must be less than number of bits in n.
Input : n = 14, k = 2 Output : Min Flips = 1 Explanation : Binary representation of 14 = 1110 Largest 4-digit Binary number with 2 set bit = 1100 Conversion from 1110 to 1100 requires 1 flipping Input : n = 145, k = 4 Output : Min Flips = 3 Explanation : Binary representation of 145 = 10010001 Largest 8-digit Binary number with 4 set bit = 11110000 Conversion from 10010001 to 11110000 requires 3 flipping
For the given number n and k find the largest number possible with k-set bits and having exactly same number of bits as n has as :
- size = log2(n) + 1 gives the number of bits of n.
- max = pow(2, k) – 1 gives largest possible number with k bits.
- max = max << (size – k) gives the largest number possible with k-set bits and having exactly same number of bits as n has
- Number of set bit in (n XOR max ) is our required number of flipping.
Illustration of above approach :
let n = 145 (10010001), k = 4 size = log2(n) + 1 = log2(145) + 1 = 7 + 1 = 8 max = pow(2, k) -1 = pow(2, 4) - 1 = 16 - 1 = 15 (1111) max = max << (size - k) = 15 << (8 - 4) = 240 (11110000) number of set bit in = no. of set bit in (n XOR max ) (145 ^ 240 ) = 3
Min Flips = 3
This article is contributed by Shivam Pradhan (anuj_charm). If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Write an Efficient Method to Check if a Number is Multiple of 3
- Find the Number Occurring Odd Number of Times
- Write an Efficient C Program to Reverse Bits of a Number
- Count set bits in an integer
- Count number of bits to be flipped to convert A to B
- Rotate bits of a number
- Compute the minimum or maximum of two integers without branching
- Compute modulus division by a power-of-2-number
- Find whether a given number is a power of 4 or not
- Add 1 to a given number
- Next higher number with same number of set bits
- Program to count number of set bits in an (big) array
- Count total set bits in all numbers from 1 to n
- Swap bits in a given number
- Binary representation of a given number