Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Count number of bits to be flipped to convert A to B

  • Difficulty Level : Easy
  • Last Updated : 07 Sep, 2021

Given two numbers ‘a’ and b’. Write a program to count number of bits needed to be flipped to convert ‘a’ to ‘b’. 
Example : 
 

Input : a = 10, b = 20
Output : 4
Binary representation of a is 00001010
Binary representation of b is 00010100
We need to flip highlighted four bits in a
to make it b.

Input : a = 7, b = 10
Output : 3
Binary representation of a is 00000111
Binary representation of b is 00001010
We need to flip highlighted three bits in a
to make it b.

 

Become a success story instead of just reading about them. Prepare for coding interviews at Amazon and other top product-based companies with our Amazon Test Series. Includes topic-wise practice questions on all important DSA topics along with 10 practice contests of 2 hours each. Designed by industry experts that will surely help you practice and sharpen your programming skills. Wait no more, start your preparation today!

 

  1. Calculate XOR of A and B.      
        a_xor_b = A ^ B
  2. Count the set bits in the above 
     calculated XOR result.
        countSetBits(a_xor_b)

XOR of two number will have set bits only at those places where A differs from B. 
 



C++




// Count number of bits to be flipped
// to convert A into B
#include <iostream>
using namespace std;
 
// Function that count set bits
int countSetBits(int n)
{
    int count = 0;
    while (n > 0)
    {
        count++;
        n &= (n-1);
    }
    return count;
}
 
// Function that return count of
// flipped number
int FlippedCount(int a, int b)
{
    // Return count of set bits in
    // a XOR b
    return countSetBits(a^b);
}
 
// Driver code
int main()
{
    int a = 10;
    int b = 20;
    cout << FlippedCount(a, b)<<endl;
    return 0;
}
Java



// Count number of bits to be flipped
// to convert A into B
import java.util.*;
 
class Count {
     
    // Function that count set bits
    public static int countSetBits(int n)
    {
        int count = 0;
        while (n != 0) {
            count++;
            n &=(n-1);
        }
        return count;
    }
 
    // Function that return count of
    // flipped number
    public static int FlippedCount(int a, int b)
    {
        // Return count of set bits in
        // a XOR b
        return countSetBits(a ^ b);
    }
     
    // Driver code
    public static void main(String[] args)
    {
        int a = 10;
        int b = 20;
        System.out.print(FlippedCount(a, b));
    }
}
 
// This code is contributed by rishabh_jain
Python3



# Count number of bits to be flipped
# to convert A into B
 
# Function that count set bits
def countSetBits( n ):
    count = 0
    while n:
        count += 1
        n &= (n-1)
    return count
     
# Function that return count of
# flipped number
def FlippedCount(a , b):
 
    # Return count of set bits in
    # a XOR b
    return countSetBits(a^b)
 
# Driver code
a = 10
b = 20
print(FlippedCount(a, b))
 
# This code is contributed by "Sharad_Bhardwaj".
C#



// Count number of bits to be
// flipped to convert A into B
using System;
 
class Count {
     
    // Function that count set bits
    public static int countSetBits(int n)
    {
        int count = 0;
        while (n != 0) {
            count++;
            n &= (n-1);
        }
        return count;
    }
 
    // Function that return
    // count of flipped number
    public static int FlippedCount(int a, int b)
    {
    // Return count of set
    // bits in a XOR b
        return countSetBits(a ^ b);
    }
     
    // Driver code
    public static void Main()
    {
        int a = 10;
        int b = 20;
        Console.WriteLine(FlippedCount(a, b));
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// Count number of bits to be
// flipped to convert A into B
 
// Function that count set bits
function countSetBits($n)
{
    $count = 0;
    while($n)
    {
        $count += 1;
        $n &= (n-1);
    }
    return $count;
}
     
// Function that return
// count of flipped number
function FlippedCount($a, $b)
{
    // Return count of set
    // bits in a XOR b
    return countSetBits($a ^ $b);
}
 
// Driver code
$a = 10;
$b = 20;
echo FlippedCount($a, $b);
 
// This code is contributed by mits
?>
Javascript



<script>
// Count number of bits to be flipped
// to convert A into Bclass Count {
 
    // Function that count set bits
    function countSetBits(n) {
        var count = 0;
        while (n != 0) {
            count++;
            n &= (n - 1);
        }
        return count;
    }
 
    // Function that return count of
    // flipped number
    function FlippedCount(a , b) {
        // Return count of set bits in
        // a XOR b
        return countSetBits(a ^ b);
    }
 
    // Driver code
        var a = 10;
        var b = 20;
        document.write(FlippedCount(a, b));
 
// This code is contributed by shikhasingrajput
</script>
Output
4
Another approach : 
C++



// C++ program
#include <iostream>
using namespace std;
 
int countFlips(int a, int b)
{
 
  // initially flips is equal to 0
  int flips = 0;
 
  // & each bits of a && b with 1
  // and store them if t1 and t2
  // if t1 != t2 then we will flip that bit
 
  while(a > 0 || b > 0){
 
    int t1 = (a&1);
    int t2 = (b&1);
 
    if(t1!=t2){
      flips++;
    }
    // right shifting a and b
    a>>=1;
    b>>=1;
  }
 
  return flips;
}
 
int main () {
  int a = 10;
  int b = 20;
  cout <<countFlips(a, b);
}
 
// this code is contributed by shivanisinghss2110
Java



/*package whatever //do not write package name here */
 
// CONTRIBUTED BY PRAVEEN VISHWAKARMA
 
import java.io.*;
 
class GFG {
       
      public static int countFlips(int a, int b){
          // initially flips is equal to 0
        int flips = 0;
       
          // & each bits of a && b with 1
          // and store them if t1 and t2
        // if t1 != t2 then we will flip that bit
         
          while(a>0 || b>0){
           
            int t1 = (a&1);
              int t2 = (b&1);
               
              if(t1!=t2){
                flips++;
            }
              // right shifting a and b
              a>>>=1;
              b>>>=1;
        }
       
      return flips;
    }
       
    public static void main (String[] args) {
        int a = 10;
          int b = 20;
          System.out.println(countFlips(a, b));
    }
   
}
Python3



def countFlips(a, b):
     
    # initially flips is equal to 0
    flips = 0
     
    # & each bits of a && b with 1
    # and store them if t1 and t2
    # if t1 != t2 then we will flip that bit
    while(a > 0 or b > 0):
        t1 = (a & 1)
        t2 = (b & 1)
        if(t1 != t2):
            flips += 1
             
        # right shifting a and b
        a>>=1
        b>>=1
     
    return flips
     
a = 10
b = 20
print(countFlips(a, b))
 
# This code is contributed by shivanisinghss2110
C#



/*package whatever //do not write package name here */
using System;
 
class GFG {
       
      public static int countFlips(int a, int b)
      {
         
          // initially flips is equal to 0
        int flips = 0;
       
          // & each bits of a && b with 1
          // and store them if t1 and t2
        // if t1 != t2 then we will flip that bit       
          while(a > 0 || b > 0){
           
            int t1 = (a&1);
              int t2 = (b&1);
               
              if(t1 != t2){
                flips++;
            }
              // right shifting a and b
              a>>=1;
              b>>=1;
        }
       
      return flips;
    }
     
  // Driver code
    public static void Main (String[] args) {
        int a = 10;
          int b = 20;
          Console.Write(countFlips(a, b));
    }
   
}
 
// This code is contributed by shivanisinghss2110
Javascript



<script>
/*package whatever //do not write package name here */
 
function countFlips(a, b){
          // initially flips is equal to 0
        var flips = 0;
       
          // & each bits of a && b with 1
          // and store them if t1 and t2
        // if t1 != t2 then we will flip that bit
         
          while(a>0 || b>0){
           
            var t1 = (a&1);
              var t2 = (b&1);
               
              if(t1!=t2){
                flips++;
            }
              // right shifting a and b
              a>>>=1;
              b>>>=1;
        }
       
      return flips;
    }
       
          var a = 10;
          var b = 20;
          document.write(countFlips(a, b));
 
// This code is contributed by shivanisinghss2110
</script>
Output
4
Thanks to Sahil Rajput for providing above implementation.
 
To get the set bit count please see this post: Count set bits in an integer
If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. 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.
 



My Personal Notes
arrow_drop_up
Previous
Count 'd' digit positive integers with 0 as a digit
Next

Count set bits in an integer
Recommended Articles
Page :
Count number of bits to be flipped to convert A to B | Set-2
20, Aug 19
Count of total bits toggled/flipped in binary representation of 0 to N
24, Jun 20
Minimum number of bits required to be flipped such that Bitwise OR of A and B is equal to C
19, Apr 21
Minimum number of bits of array elements required to be flipped to make all array elements equal
19, Apr 21
Minimize bits to be flipped in X and Y such that their Bitwise OR is equal to Z
29, Apr 20
Count of pairs {X, Y} from an array such that sum of count of set bits in X ⊕ Y and twice the count of set bits in X & Y is M
12, Mar 21
Count of 0s to be flipped to make any two adjacent 1s at least K 0s apart
03, Jul 20
Find zeroes to be flipped so that number of consecutive 1's is maximized
07, Nov 15
Maximum number of 0s that can be flipped such that Array has no adjacent 1s
13, Jun 20
Check if bits of a number has count of consecutive set bits in increasing order
12, Jan 17
Maximize 0s to be flipped in given Binary array such that there are at least K 0s between two 1s
27, Oct 21
Flip bits of the sum of count of set bits of two given numbers
03, Jan 21
Toggle bits of a number except first and last bits
14, Jan 18
Print numbers having first and last bits as the only set bits
15, Jan 18
Check if all bits can be made same by flipping two consecutive bits
09, Jan 20
Minimize cost of swapping set bits with unset bits in a given Binary string
18, Aug 21
Program to count number of set bits in an (big) array
12, Mar 11
Count total bits in a number
18, Sep 17
Count unset bits of a number
22, Sep 17
Count number of bits changed after adding 1 to given N
19, Nov 18
Find a number X such that (X XOR A) is minimum and the count of set bits in X and B are equal
20, Nov 19
Count of pairs in an Array with same number of set bits
21, May 20
Maximum number of set bits count in a K-size substring of a Binary String
09, Jun 20
Count Set-bits of number using Recursion
13, Aug 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!