- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

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

# Number of pairs with Bitwise OR as Odd number in C++

Given an array, we have to find the number of pairs whose Bitwise OR is an odd number. Let's see the example.

**Input**

arr = [1, 2]

**Output**

1

There is only one pair whose Bitwise OR is an odd number. And the pair is (1, 2).

## Algorithm

- Initialise the array with random numbers.
- Initialise the count to 0.
- Write two loops to get the pairs of the array.
- Compute the bitwise OR between every pair.
- Increment the count if the result is an odd number.

- Return the count.

## Implementation

Following is the implementation of the above algorithm in C++

#include <bits/stdc++.h> using namespace std; int getOddPairsCount(int arr[], int n) { int count = 0; for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if ((arr[i] | arr[j]) % 2 != 0) { count++; } } } return count; } int main() { int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; int n = 10; cout << getOddPairsCount(arr, n) << endl; return 0; }

## Output

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

35

- Related Questions & Answers
- Count pairs with Bitwise AND as ODD number in C++
- Count pairs with Bitwise XOR as ODD number in C++
- Count pairs with Bitwise OR as Even number in C++
- Count pairs with Bitwise-AND as even number in C++
- Count pairs with Bitwise XOR as EVEN number in C++
- Count number of ordered pairs with Even and Odd Product in C++
- Count number of ordered pairs with Even and Odd Sums in C++
- Count pairs with bitwise OR less than Max in C++
- Number of integers with odd number of set bits in C++
- Construct an NFA accepting strings with an even number of 0s or an odd number of 1s
- Number of pairs with maximum sum in C++
- Express an odd number as sum of prime numbers in C++
- Splitting number to contain continuous odd or even number using JavaScript
- Count all pairs of adjacent nodes whose XOR is an odd number in C++
- Find the number of subarrays have bitwise OR >= K using C++

Advertisements