Check if bits in Range L to R of Two Numbers are Complement of Each other or Not

Let's assume we have two non-negative numbers, x and y, as well as two values, l and r. We have to determine whether or not all bits in the range l to r of both given numbers are complements of one another.

We will learn how to determine whether the bits in the range L to R of two numbers are complements in this article.

Examples:

Check if bits in Range L to R of Two Numbers are Complement of Each other or Not

The bits are numbered from right to left, beginning with the least significant bit.

The steps to solving the problem are outlined below.

Obtain xor_value = x ^ y.
Determine whether or not all of the bits in the range l to r of the xor value are set.

The above strategy is carried out as follows.

C++ Program:

// C++ code for checking whether all of the bits in a certain range of two numbers are complements
#include <bits/stdc++.h>
using namespace std;

bool GivenRange(unsigned int n,
							unsigned int l,
							unsigned int r)
{
	// The only set bits are those in the range l to r when calculating a number 'number' with 'r' number of bits
	int number = ((1 << r) - 1) ^ ((1 << (l - 1)) - 1);

	// new number with one or more set bits in the range l to r and no other bits
	int new_number = n & number;

	// If both are equivalent, then all bits in the specified range are set.
	if (number == new_number)
		return true;

	// Otherwise, all bits are not set.
	return false;
}

// function that determines whether all of the bits in a given range of two numbers are complements of one another
bool bitsComplement(unsigned int x, unsigned int y,
					unsigned int l, unsigned int r)
{
	unsigned int xor_value = x ^ y;
	return GivenRange(xor_value, l, r);
}

// Driver Code
int main()
{
	unsigned int x = 10, y = 5;
	unsigned int l = 1, r = 3;

	if (bitsComplement(x, y, l, r))
		cout << "Yes";
	else
		cout << "No";

	return 0;
}

Output: