Given an integer . The task is to find the number of bits changed after adding 1 to the given number.
Input : N = 5 Output : 2 After adding 1 to 5 it becomes 6. Binary representation of 5 is 101. Binary representation of 6 is 110. So, no. of bits changed is 2. Input : N = 1 Output : 2
There are three approaches to find the number of changed bits in the result obtained after adding 1 to the given value N:
- Approach 1: Add 1 to given integer and compare the bits of N and the result obtained after addition and count the number of unmatched bit.
- Approach 2: In case if 1 is added to N, then the total number of bits changed is defined by the position of 1st Zero from right i.e. LSB as zero. In the case, 1 is added to 1 then it got changed and pass a carry 1 to its next bit but if 1 is added to 0 only 0 changes to 1 and no further carry is passed.
- Approach 3: For finding number of changed bits when 1 is added to a given number take XOR of n and n+1 and calculate the number of set bits in the resultant XOR value.
Below is the implementation of the Approach 3:
# Python 3 program to find the number
# of changed bit
# Function to find number of changed bit
# Calculate xor of n and n+1
XOR = n ^ (n + 1)
# Count set bits in xor value
result = bin(XOR).count(“1”)
# Return the result
# Driver Code
if __name__ == ‘__main__’:
n = 6
n = 7
# This code is contributed by
- Maximum sum by adding numbers with same number of set bits
- Check if bits of a number has count of consecutive set bits in increasing order
- Count pairs (A, B) such that A has X and B has Y number of set bits and A+B = C
- Count total bits in a number
- Count unset bits of a number
- Count number of bits to be flipped to convert A to B
- Program to count number of set bits in an (big) array
- Toggle bits of a number except first and last bits
- Count set bits in a range
- Count set bits in an integer
- Count unset bits in a range
- Python | Count set bits in a range
- Count total set bits in all numbers from 1 to n
- Range query for count of set bits
- Count of divisors having more set bits than quotient on dividing N
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.
Improved By : SURENDRA_GANGWAR