We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
using namespace std
int main() {
int l, r;
cin >> l >> r;
int xo = 0;
for (int i = l; i <= r; i++) {
for (int j = i; j <= r; j++) {
int d = 0;
d = i ^ j;
if (d > xo)
xo = d;
}
}
cout << xo << endl;
return 0;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Maximizing XOR
You are viewing a single comment's thread. Return to all comments →
include
using namespace std int main() { int l, r; cin >> l >> r; int xo = 0; for (int i = l; i <= r; i++) { for (int j = i; j <= r; j++) { int d = 0; d = i ^ j; if (d > xo) xo = d; }
}