- Related Questions & Answers
- Count numbers whose difference with N is equal to XOR with N in C++
- Count smaller numbers whose XOR with n produces greater value in C++
- Count numbers whose sum with x is equal to XOR with x in C++
- Find N distinct numbers whose bitwise Or is equal to K in C++
- Count numbers (smaller than or equal to N) with given digit sum in C++
- Find N distinct numbers whose bitwise Or is equal to K in Python
- Largest set with bitwise OR equal to n in C++
- Minimum numbers which is smaller than or equal to N and with sum S in C++
- Count numbers < = N whose difference with the count of primes upto them is > = K in C++
- Find a Number X whose sum with its digits is equal to N in C++
- Maximum Primes whose sum is equal to given N in C++
- Count smaller values whose XOR with x is greater than x in C++
- Find all factorial numbers less than or equal to n in C++
- Print all prime numbers less than or equal to N in C++
- Print all Semi-Prime Numbers less than or equal to N in C++

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

We are a number N. The goal is to find numbers between 0 and N whose OR with N is equal to XOR with N.

We will do this by traversing no. from i=0 to i<=N and for each i, if (N^i==i | N) then increment count.

Let us understand with examples.

**Input** − X=6

**Output** − Count of numbers whose OR with N == XOR with N: 2

**Explanation** − Numbers are 0 1.

**Input** − X=20

**Output** − Count of numbers whose OR with N == XOR with N: 8

**Explanation** − Numbers are 0 1 2 3 8 9 10 11

We take integer N.

Function orisXOR(int n) takes n and returns a count of numbers whose OR with n is equal to XOR with n.

Take the initial count as 0.

Traverse from i=0 to i<=n.

If i|n==i^n. Increment count

At the end of for loop count will have the desired result.

Return count and print.

#include <bits/stdc++.h> #include <math.h> using namespace std; int orisXOR(int n){ int count = 0; for (int i = 0; i <= n; i++){ if((n|i)==(i^n)) { count++; } } return count; } int main(){ int N = 15; int nums=orisXOR(N); cout <<endl<<"Count of numbers whose OR with N == XOR with N: "<<nums; return 0; }

If we run the above code it will generate the following output −

Count of numbers whose OR with N == XOR with N: 1

Advertisements