3 cf problems + 1 usaco

Author: naowalrahman

codeforces/1816A.cpp

@@ -0,0 +1,35 @@
+/**
+ * @file 1816A.cpp
+ * @author Naowal Rahman
+ * @date 2023-04-09 10:57
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+#define all(x) x.begin(), x.end()
+#define FOR(i, s, e) for(int i = s; i < e; i++)
+#define FORE(i, s, e) for(int i = s; i <= e; i++)
+typedef long long ll;
+typedef vector<int> vi;
+
+inline void dbg() {
+    #ifndef ONLINE_JUDGE
+    freopen("../input.txt", "r", stdin);
+    freopen("../output.txt", "w", stdout);
+    #endif //
+}
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    dbg();
+
+    int t, a, b, mx, mn; cin >> t;
+    while(t--) {
+        cin >> a >> b;
+        cout << 2 << "\n" << 1 << " " << b-1
+                  << "\n" << a << " " << b << "\n";
+    }
+
+    return 0;
+}

codeforces/1816B.cpp

@@ -0,0 +1,65 @@
+/**
+ * @file 1816B.cpp
+ * @author Naowal Rahman
+ * @date 2023-04-09 11:39
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+#define all(x) x.begin(), x.end()
+#define FOR(i, s, e) for(int i = s; i < e; i++)
+#define FORE(i, s, e) for(int i = s; i <= e; i++)
+typedef long long ll;
+typedef vector<int> vi;
+
+inline void dbg() {
+    #ifndef ONLINE_JUDGE
+    freopen("../input.txt", "r", stdin);
+    freopen("../output.txt", "w", stdout);
+    #endif //
+}
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    dbg();
+
+    int t, n; cin >> t;
+    while(t--) {
+        cin >> n; 
+        deque<int> nums;
+        FORE(i, 1, 2*n) nums.push_back(i);
+
+        vector<vi> grid(2, vi(n));
+
+        grid[0][0] = nums.back();
+        bool alt = true;
+        nums.pop_back();
+        FOR(i, 0, n-1) {
+            if(alt) {
+                grid[1][i] = nums.front();
+                nums.pop_front();
+                grid[0][i+1] = nums.front();
+                nums.pop_front();
+            }
+            else {
+                grid[1][i] = nums.back();
+                nums.pop_back();
+                grid[0][i+1] = nums.back();
+                nums.pop_back();
+            }
+            alt = !alt;
+        }
+
+        grid[1][n-1] = nums.back();
+        swap(grid[1][1], grid[1][n-1]);
+
+        for(vi line : grid) {
+            for(int num : line) cout << num << " ";
+            cout << "\n";
+        }
+        
+    }
+
+    return 0;
+}

codeforces/1816C.cpp

@@ -0,0 +1,35 @@
+/**
+ * @file 1816C.cpp
+ * @author Naowal Rahman
+ * @date 2023-04-09 12:47
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+#define all(x) x.begin(), x.end()
+#define FOR(i, s, e) for(int i = s; i < e; i++)
+#define FORE(i, s, e) for(int i = s; i <= e; i++)
+typedef long long ll;
+typedef vector<int> vi;
+
+inline void dbg() {
+    #ifndef ONLINE_JUDGE
+    freopen("../input.txt", "r", stdin);
+    freopen("../output.txt", "w", stdout);
+    #endif //
+}
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(0);
+    dbg();
+
+    int t, n; cin >> t;
+    while(t--) {
+        cin >> n;
+        vi arr(n);
+        for(auto&x:arr) cin >> x;
+    }
+
+    return 0;
+}

input.txt

@@ -1,13 +1,4 @@
-4
 3
-10 20 15
-9 8 6
-1
-5
-7
+2
 4
-13 8 5 4
-3 4 2 1
-3
-1000000000 1000000000 1000000000
-1 1 1000000000
+6

output.txt

@@ -1,4 +1,6 @@
-9 9 12 
-5 
-3 8 6 4 
-1 2 2999999997 
+4 2 
+1 3 
+8 2 6 4 
+1 5 3 7 
+12 2 10 4 8 6 
+1 7 3 9 5 11 

usaco/bronze/its_all_about_the_base.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    ifstream cin("whatbase.in");
+    ofstream cout("whatbase.out");
+
+    auto toBase10 = [](vector<int>& x, int b) {
+        return x[0] + x[1] * b + x[2] * b * b;
+    };
+    
+    int k, nx, ny; cin >> k;
+    while(k--) {
+        cin >> nx >> ny;
+        vector<int> xd = {nx%10, (nx/10)%10, (nx/100)%10};
+        vector<int> yd = {ny%10, (ny/10)%10, (ny/100)%10};
+
+        int xb = 10, yb = 10;
+        while(xb < 15000 && yb < 15000) {
+            int xe = toBase10(xd, xb), ye = toBase10(yd, yb);
+            if(xe == ye) {
+                cout << xb << " " << yb << "\n";
+                break;
+            }
+            else if(xe < ye) ++xb;
+            else ++yb;
+        }
+    }
+
+    return 0;
+}