Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Largest set with bitwise OR equal to n in C++
In this tutorial, we are going to write a program that finds the largest set with bitwise OR is equal to the given number n.
Let's see the steps to solve the problem.
- Initialise the number n.
- Write a loop that iterates from 0 to n.
- If the i | n is equal to n, then add i to the result.
- Return the result.
Example
Let's see the code.
#include <bits/stdc++.h>
using namespace std;
void printBitWiseOrSet(int n) {
vector<int> v;
for (int i = 0; i <= n; i++) {
if ((i | n) == n) {
v.push_back(i);
}
}
for (int i = 0; i < v.size(); i++) {
cout << v[i] << ' ';
}
cout << endl;
}
int main() {
int n = 7;
printBitWiseOrSet(n);
return 0;
}Output
If you run the above code, then you will get the following result.
0 1 2 3 4 5 6 7
Conclusion
If you have any queries in the tutorial, mention them in the comment section.
Updated on: 09-Apr-2021
53 Views
Advertisements