aboutsummaryrefslogtreecommitdiff
path: root/Flipping_bits/Flipping_bits.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 /Flipping_bits/Flipping_bits.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 'Flipping_bits/Flipping_bits.cpp')
-rw-r--r--Flipping_bits/Flipping_bits.cpp16
1 files changed, 16 insertions, 0 deletions
diff --git a/Flipping_bits/Flipping_bits.cpp b/Flipping_bits/Flipping_bits.cpp
new file mode 100644
index 0000000..e06235b
--- /dev/null
+++ b/Flipping_bits/Flipping_bits.cpp
@@ -0,0 +1,16 @@
+#include<bits/stdc++.h>
+
+
+using namespace std;
+
+int main(){
+ int n, x=pow(2, 31) - 1;
+ cin >> n;
+ cout << n ^ x;
+ // 0 0 -> 1 -> 0
+ // 1 1 -> 0 -> 1
+ // 1 1 -> 0 -> 1
+ // 1 1 -> 0 -> 0
+
+ return 0;
+}