aboutsummaryrefslogtreecommitdiff
path: root/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.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.cpp')
-rw-r--r--MaximizingXOR.cpp17
1 files changed, 0 insertions, 17 deletions
diff --git a/MaximizingXOR.cpp b/MaximizingXOR.cpp
deleted file mode 100644
index 71fc6d8..0000000
--- a/MaximizingXOR.cpp
+++ /dev/null
@@ -1,17 +0,0 @@
-#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;
-}