Find a value whose XOR with given number is maximum

Given a value X, the task is to find the number Y which will give maximum value possible when XOR with X.
(Assume X to be 8 bits) Maximum possible value of X and Y both is 255.

Examples:

Input:  X = 2
Output: 253
Binary Representation of X = 00000010
Binary Representation of Y = 11111101
Maximum XOR value: 11111111

Input:  X = 200
Output: 55



Approach: In order to ensure maximum value of XOR, we need to set all those bits ON which are OFF in X. So for that, Y should have all bits ON which are OFF in X and OFF which are ON in X as (0^1 = 1 and 1^0 = 1). So Y should be the 1’s complement representation of X.

Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation of the above approach
#include <bits/stdc++.h>
using namespace std;
  
// Function To Calculate Answer
int calculate(int X)
{
    // Find number of bits in the given integer
    int number_of_bits = 8;
  
    // XOR the given integer with poe(2,
    // number_of_bits-1 and print the result
    return ((1 << number_of_bits) - 1) ^ X;
}
  
// Driver Code
int main()
{
    int X = 4;
  
    cout << "Required Number is : "
         << calculate(X) << endl;
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation of the above approach
  
import java.io.*;
  
class GFG {
      
// Function To Calculate Answer
static int calculate(int X)
{
    // Find number of bits in the given integer
    int number_of_bits = 8;
  
    // XOR the given integer with poe(2,
    // number_of_bits-1 and print the result
    return ((1 << number_of_bits) - 1) ^ X;
}
  
// Driver Code
  
  
    public static void main (String[] args) {
        int X = 4;
  
    System.out.println( "Required Number is : "
        +calculate(X));
    }
}
// This code is contributed by shs..

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 implementation of the above approach 
  
# Function To Calculate Answer 
def calculate(X): 
   
    # Find number of bits in the given integer 
    number_of_bits = 8 
    
    # XOR the given integer with poe(2, 
    # number_of_bits-1 and print the result 
    return ((1 << number_of_bits) - 1) ^ X 
    
# Driver Code 
if __name__ == "__main__":
   
    X = 4 
    print("Required Number is:", calculate(X)) 
    
# This code is contributed by Rituraj Jain

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 Calculate Answer
static int calculate(int X)
{
    // Find number of bits in
    // the given integer
    int number_of_bits = 8;
  
    // XOR the given integer with poe(2,
    // number_of_bits-1 and print the result
    return ((1 << number_of_bits) - 1) ^ X;
}
  
// Driver Code
public static void Main () 
{
    int X = 4;
  
    Console.WriteLine("Required Number is : "
                                 calculate(X));
}
}
  
// This code is contributed by shs..

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP implementation of the 
// above approach
  
// Function To Calculate Answer
function calculate($X)
{
    // Find number of bits in 
    // the given integer
    $number_of_bits = 8;
  
    // XOR the given integer with 
    // poe(2, number_of_bits-1 and 
    // print the result
    return ((1 << $number_of_bits) - 1) ^ $X;
}
  
// Driver Code
$X = 4;
  
echo "Required Number is : "
      calculate($X) . "\n";
  
// This code is contributed 
// by Akanksha Rai
?>

chevron_right


Output:

Required Number is : 251


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.