Add files via upload

Author: BrandonTang89

Other_Tasks/CF2065_A_Skibidus_and_Amog_u.py

@@ -0,0 +1,3 @@
+for _ in range(int(input())):
+    s = input()
+    print(s[:-2] + 'i')

Other_Tasks/CF2065_B_Skibidus_and_Ohio.py

@@ -0,0 +1,4 @@
+for _ in range(int(input())):
+    s = input()
+    can = any([s[i] == s[i + 1] for i in range(len(s) - 1)])
+    print(1 if can else len(s))

Other_Tasks/CF2065_C_2_Skibidus_and_Fanum_Tax_hard_version.cpp

@@ -0,0 +1,51 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+typedef long long ll;
+typedef vector<int> vi;
+#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+
+
+int main(){
+    int tc;
+    cin >> tc;
+    while (tc--){
+        int n, m;
+        cin >> n >> m;
+        vector<ll> a(n), b(m);
+        for (int i = 0; i < n; i++){
+            cin >> a[i];
+        }  
+        for (int i = 0; i < m; i++){
+            cin >> b[i];
+        }
+
+        sort(b.begin(), b.end());
+        ll prev = -1e12;
+        bool can = true;
+        for (int i=0; i<n; i++){
+            int idx  = lower_bound(b.begin(), b.end(), a[i] + prev) - b.begin();
+            ll cur = (idx == m) ? 1e12 : b[idx] - a[i];
+            if (a[i] < cur && a[i] >= prev){
+                cur = a[i];
+            }
+
+            if (cur == 1e12){
+                cout << "NO" << endl;
+                can = false;
+                break;
+            }
+            else{
+                prev = cur;
+            }
+        }
+
+        if (can){
+            cout << "YES" << endl;
+        }
+    }
+
+    return 0;
+}

Other_Tasks/CF2065_D_Skibidus_and_Sigma.cpp

@@ -0,0 +1,56 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+typedef long long ll;
+typedef vector<int> vi;
+#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+
+
+
+int main(){
+    int tc;
+    cin >> tc;
+    while (tc--){
+        int n, m;
+        cin >> n >> m;
+        vector<vector<ll>> a(n, vector<ll>(m));
+        for (int i = 0; i < n; i++){
+            for (int j = 0; j < m; j++){
+                cin >> a[i][j];
+            }
+        }
+        vector<ll> sums(n);
+        for (int i = 0; i < n; i++){
+            for (int j = 0; j < m; j++){
+                sums[i] += a[i][j];
+            }
+        }
+
+        vector<int> perm(n);
+        iota(perm.begin(), perm.end(), 0);
+        sort(perm.begin(), perm.end(), [&](int i, int j){
+            return sums[i] > sums[j];
+        });
+
+        vector<ll> total; 
+        for (int i=0; i<n; i++){
+            for (int j=0; j<m; j++){
+                total.push_back(a[perm[i]][j]);
+            }
+        }
+
+        ll prefix = 0;
+        ll total_sum = 0;
+        for (int i=0; i<n*m; i++){
+            prefix += total[i];
+            total_sum += prefix;
+        }
+
+        cout << total_sum << endl;
+    }
+
+
+    return 0;
+}

Other_Tasks/CF2065_E_Skibidus_and_Rizz.py

@@ -0,0 +1,28 @@
+for _ in range(int(input())):
+    n, m, k = map(int, input().split())
+    
+    if n < k and m < k: 
+        print(-1)
+        continue
+    
+    if max(n, m) - min(n, m) > k:
+        print(-1)
+        continue
+    
+    if n > m:
+        start = 0
+    else:
+        start = 1
+        
+    ans = ""
+    while n > 0 or m > 0:
+        if start == 0:
+            ans += "0" * min(k, n)
+            n -= min(k, n)
+            start = 1
+        else:
+            ans += "1" * min(k, m)
+            m -= min(k, m)
+            start = 0
+    
+    print(ans)