Find a value whose XOR with given number is maximum in C++

In this tutorial, we are going to write a program that finds the number whose XOR operation with the given number is maximum.

We are assuming the number of bits here is 8.

The XOR operation of different bits gives you the 1 bit. And the XOR operation between the same bits gives you the 0 bit.

If we find the 1's complement of the given number, then that's the number we are looking for.

Example

Let's see the code.

 Live Demo

#include <bits/stdc++.h>
using namespace std;
int findNumberWithMaximumXOR(int X) {
   return ((1 << 8) - 1) ^ X;
}
int main() {
   int X = 4;
   cout << findNumberWithMaximumXOR(X) << endl;
   return 0;
}

Output

If you run the above code, then you will get the following result.

251

Conclusion

If you have any queries in the tutorial, mention them in the comment section.

Hafeezul Kareem

Published on 01-Feb-2021 12:08:36

• Related Questions & Answers
• Maximum XOR value in matrix in C++
• Count smaller numbers whose XOR with n produces greater value in C++
• Find maximum XOR of given integer in a stream of integers in C++
• Find the node whose absolute difference with X gives maximum value in C++
• Find Maximum XOR value of a sub-array of size k in C++
• Find a pair from the given array with maximum nCr value in C++
• Maximum XOR value of a pair from a range in C++
• Maximum Primes whose sum is equal to given N in C++
• C program to find out the maximum value of AND, OR, and XOR operations that are less than a given value
• Count numbers whose difference with N is equal to XOR with N in C++
• Count numbers whose sum with x is equal to XOR with x in C++
• Count numbers whose XOR with N is equal to OR with N in C++
• Count all pairs of adjacent nodes whose XOR is an odd number in C++
• Count smaller values whose XOR with x is greater than x in C++
• Find a Number X whose sum with its digits is equal to N in C++