Programming Problem One

Problem Statement:   Given two numbers (int) L (low) and H (high) , The problem is to find the maximum value of A xor B such that  L ≤ A ≤ B ≤ U.

C++ Code:

1. #include <iostream>
2. using namespace std;
3. 
   
4. int maxXor(int l, int r) 
5. {
6. int max = 0;
7. for (int i = l; i <= r; ++i) {
8. for (int j = l; j <= r; ++j) {
9. if((i ^ j) >= max) {
10. max = i ^ j;
11. }
12. }
13. }
14. return max;
15. }
16.  
17. int main() 
18. {
19. int res, l, r;
20.  
21. cin >> l;
22. cin >> r;
23.  
24. res = maxXor(l, r);
25. cout << res;
26.   return 0;
27. }