aboutsummaryrefslogtreecommitdiff
path: root/MaximizingXOR/MaximizingXOR.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /MaximizingXOR/MaximizingXOR.cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'MaximizingXOR/MaximizingXOR.cpp')
-rw-r--r--MaximizingXOR/MaximizingXOR.cpp17
1 files changed, 17 insertions, 0 deletions
diff --git a/MaximizingXOR/MaximizingXOR.cpp b/MaximizingXOR/MaximizingXOR.cpp
new file mode 100644
index 0000000..71fc6d8
--- /dev/null
+++ b/MaximizingXOR/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;
+}