Count number of bits to be flipped to convert A to B | Set-2

Given two integers A and B, the task is to count the number of bits needed to be flipped to convert A to B.

Examples:

Input: A = 10, B = 7
Output: 3
binary(10) = 1010
binary(7) = 0111
1010
0111
3 bits need to be flipped.

Input: A = 8, B = 7
Output: 4

Approach: An approach to solve this problem has already been discussed here. Here, the count of bits that need to be flipped can be found by matching all the bits in both the integers one by one. If the bit under consideration differs then increment the count.

Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
  
// Function to return the count of bits
// to be flipped to convert a to b
int countBits(int a, int b)
{
  
    // To store the required count
    int count = 0;
  
    // Loop until both of them become zero
    while (a || b) {
  
        // Store the last bits in a
        // as well as b
        int last_bit_a = a & 1;
        int last_bit_b = b & 1;
  
        // If the current bit is not same
        // in both the integers
        if (last_bit_a != last_bit_b)
            count++;
  
        // Right shift both the integers by 1
        a = a >> 1;
        b = b >> 1;
    }
  
    // Return the count
    return count;
}
  
// Driver code
int main()
{
    int a = 10, b = 7;
  
    cout << countBits(a, b);
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation of the approach
import java.util.*;
class GFG 
{
  
// Function to return the count of bits
// to be flipped to convert a to b
static int countBits(int a, int b)
{
  
    // To store the required count
    int count = 0;
  
    // Loop until both of them become zero
    while (a > 0 || b > 0
    {
  
        // Store the last bits in a
        // as well as b
        int last_bit_a = a & 1;
        int last_bit_b = b & 1;
  
        // If the current bit is not same
        // in both the integers
        if (last_bit_a != last_bit_b)
            count++;
  
        // Right shift both the integers by 1
        a = a >> 1;
        b = b >> 1;
    }
  
    // Return the count
    return count;
}
  
// Driver code
public static void main(String[] args) 
{
    int a = 10, b = 7;
  
    System.out.println(countBits(a, b));
}
}
  
// This code is contributed by Princi Singh

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 implementation of the approach
  
# Function to return the count of bits
# to be flipped to convert a to b
def countBits(a, b):
  
    # To store the required count
    count = 0
  
    # Loop until both of them become zero
    while (a or b):
  
        # Store the last bits in a
        # as well as b
        last_bit_a = a & 1
        last_bit_b = b & 1
  
        # If the current bit is not same
        # in both the integers
        if (last_bit_a != last_bit_b):
            count += 1
  
        # Right shift both the integers by 1
        a = a >> 1
        b = b >> 1
  
    # Return the count
    return count
  
# Driver code
a = 10
b = 7
  
print(countBits(a, b))
  
# This code is contributed by Mohit Kumar

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# implementation of the above approach
using System;
  
class GFG 
{
  
// Function to return the count of bits
// to be flipped to convert a to b
static int countBits(int a, int b)
{
  
    // To store the required count
    int count = 0;
  
    // Loop until both of them become zero
    while (a > 0 || b > 0) 
    {
  
        // Store the last bits in a
        // as well as b
        int last_bit_a = a & 1;
        int last_bit_b = b & 1;
  
        // If the current bit is not same
        // in both the integers
        if (last_bit_a != last_bit_b)
            count++;
  
        // Right shift both the integers by 1
        a = a >> 1;
        b = b >> 1;
    }
  
    // Return the count
    return count;
}
  
// Driver code
public static void Main(String[] args) 
{
    int a = 10, b = 7;
  
    Console.WriteLine(countBits(a, b));
}
}
  
// This code is contributed by PrinciRaj1992

chevron_right


Output:

3


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.





Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.