level 7

Codeforces/Div-2/1831/A_Twin_Permutations.cpp

@@ -0,0 +1,32 @@
+/**
+ *	author 	: nxtsourav7
+ *	created : 2024-12-29 02:50:33
+**/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+void S0LVE() {
+    int n;
+    cin >> n;
+    vector<int> a(n);
+    for(int &x : a) cin >> x;
+
+    for(int i = 0; i < n; ++i) {
+        cout << abs(n + 1 - a[i]) << ' ';
+    }
+}
+
+int32_t main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int Q;
+    cin >> Q;
+    while(Q--) {
+        S0LVE();
+        cout << '\n';
+    }
+
+    return 0;
+}

Codeforces/Div-2/1979/B_XOR_Sequences.cpp

@@ -0,0 +1,33 @@
+/**
+ *	author 	: nxtsourav7
+ *	created : 2024-12-29 03:11:27
+**/
+
+#include<bits/stdc++.h>
+using namespace std;
+
+void S0LVE() {
+    int x, y;
+    cin >> x >> y;
+
+    for(int i = 0; i < 30; ++i) {
+        if(((x >> i) & 1) != ((y >> i) & 1)) {
+            cout << (1 << i);
+            return;
+        }
+    }
+}
+
+int32_t main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int Q;
+    cin >> Q;
+    while(Q--) {
+        S0LVE();
+        cout << '\n';
+    }
+
+    return 0;
+}