Given an integer N, task is to find the numbers which when raised to the power of 2 and added finally, gives the integer N.
Input : 71307 Output : 0, 1, 3, 7, 9, 10, 12, 16 Explanation : 71307 = 2^0 + 2^1 + 2^3 + 2^7 + 2^9 + 2^10 + 2^12 + 2^16 Input : 1213 Output : 0, 2, 3, 4, 5, 7, 10 Explanation : 1213 = 2^0 + 2^2 + 2^3 + 2^4 + 2^5 + 2^7 + 2^10
Every number can be described in powers of 2.
Example : 29 = 2^0 + 2^2 + 2^3 + 2^4.
2^0 ( exponent of 2 is ‘0’) 0
2^2 ( exponent of 2 is ‘2’) 1
2^3 ( exponent of 2 is ‘3’) 3
2^4 ( exponent of 2 is ‘4’) 4
Convert each number into its binary equivalent by pushing remainder of given number, when divided by 2 till it is greater than 0, to vector. Now, Iterate through its binary equivalent and whenever there is set bit, just print the i-th value(iteration number).
Hamming Code : Hamming Code is an error correcting code which can detect and correct one bit error. This pattern is also used in Hamming code error detection where parity bits store the XOR of numbers on the basis of LSB(Least Significant bit), where numbers are assigned in blocks and you need to find the blocks where the sum of power of 2 resulting to given number exists. Below is the image to show the blocks with given numbers.
Below is the implementation of above approach :
Blocks for 71307 : 0, 1, 3, 7, 9, 10, 12, 16 Blocks for 1213 : 0, 2, 3, 4, 5, 7, 10 Blocks for 29 : 0, 2, 3, 4 Blocks for 100 : 2, 5, 6
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Powers of 2 to required sum using Bit Masking
- Minimum number of distinct powers of 2 required to express a given binary number
- Minimum number of given powers of 2 required to represent a number
- Count of minimum reductions required to get the required sum K
- Represent n as the sum of exactly k powers of two | Set 2
- Last two digits of powers of 7
- Representation of a number in powers of other
- Sum of fifth powers of the first n natural numbers
- Find k numbers which are powers of 2 and have sum N | Set 1
- Sum of first N natural numbers which are not powers of K
- Finding powers of any number P in N!
- Sum of fourth powers of first n odd natural numbers
- Find all powers of 2 less than or equal to a given number
- Check if a number can be represented as sum of non zero powers of 2
- Sum of first N natural numbers with all powers of 2 added twice
- Distinct powers of a number N such that the sum is equal to K
- Print all prime factors and their powers
- Print all integers that are sum of powers of two given numbers
- Sum of fourth powers of the first n natural numbers
- Find the sum of numbers from 1 to n excluding those which are powers of K
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.