aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-02 07:41:10 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-02 07:41:10 +0200
commitfd318b672ef0e61a1753306cb7ec40b69080a2a7 (patch)
tree1dbbe2ae8d51637aa8694df6c8560be8384335ba
parent9056f142da2a44dc4fbec12cd7370db8e4832fe0 (diff)
downloadcompetitive-programming-fd318b672ef0e61a1753306cb7ec40b69080a2a7.tar.xz
competitive-programming-fd318b672ef0e61a1753306cb7ec40b69080a2a7.zip
Solved MaximizingXOR.cpp
-rw-r--r--MaximizingXOR.cpp17
1 files changed, 17 insertions, 0 deletions
diff --git a/MaximizingXOR.cpp b/MaximizingXOR.cpp
new file mode 100644
index 0000000..71fc6d8
--- /dev/null
+++ b/MaximizingXOR.cpp
@@ -0,0 +1,17 @@
+#include<bits/stdc++.h>
+#include <queue>
+
+using namespace std;
+
+int main() {
+ int l, r;
+ cin >> l >> r;
+ priority_queue<int>pq;
+ for(int i = l; i <= r;i++) {
+ for(int j = i; j <= r;j++) {
+ pq.push(i ^ j);
+ }
+ }
+ cout << pq.top() << '\n';
+ return 0;
+}