Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
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
Count Pairs with Bitwise XOR as Odd Number in C++
We are given an integer array and the task is to count the total number of pairs that can be formed using the given array values such that the XOR operation on the pairs will result in an ODD value.
The truth table for XOR operation is given below
| A | B | A XOR B |
| 0 | 0 | 0 |
| 1 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 1 | 0 |
Input − int arr[] = {2, 8, 1, 5, 11}
Output − Count of pairs with Bitwise XOR as ODD number are − 6
Explanation
Explanation −
| a1 | a2 | a1 XOR a2 |
| 2 | 8 | 10 |
| 2 | 1 | 3 |
| 2 | 5 | 7 |
| 2 | 11 | 9 |
| 8 | 1 | 9 |
| 8 | 5 | 13 |
| 8 | 11 | 3 |
| 1 | 5 | 4 |
| 1 | 11 | 10 |
| 5 | 11 | 14 |
Approach used in the below program is as follows
Input an array of integer elements to form an pair
Calculate the size of an array pass the data to the function for further processing
Create a temporary variable count to store the pairs formed with XOR operation as an odd value.
Start loop FOR from i to 0 till the size of an array
Now calculate the odd value pairs in an array as count * (size - count)
Return the odd
Print the result
Example
#include <iostream>
using namespace std;
//Count pairs with Bitwise XOR as ODD number
int XOR_Odd(int arr[], int size){
int count = 0;
for (int i = 0; i < size; i++){
if (arr[i] % 2 == 0){
count++;
}
}
int odd = count * (size-count);
return odd;
}
int main(){
int arr[] = { 6, 1, 3, 4, 8, 9};
int size = sizeof(arr) / sizeof(arr[0]);
cout<<"Count of pairs with Bitwise XOR as ODD number are: "<<XOR_Odd(arr, size);
return 0;
}
Output
If we run the above code it will generate the following output −
Count of pairs with Bitwise XOR as ODD number are: 9
198 Views
