Add files via upload

Author: BrandonTang89

Other_Tasks/CF2104_A_Three_Decks.py

@@ -0,0 +1,18 @@
+for _ in range(int(input())):
+    a, b, c = map(int, input().split())
+    if (a + b + c) % 3 != 0:
+        print("NO")
+        continue
+    
+    target = (a + b + c) // 3
+    
+    if b > target:
+        print("NO")
+        continue
+    
+    avail = c - target
+    need = (target - a) + (target - b)
+    if avail >= need:
+        print("YES")
+    else:
+        print("NO")    

Other_Tasks/CF2104_B_Move_to_the_End.py

@@ -0,0 +1,17 @@
+for _ in range(int(input())):
+    n = int(input())
+    arr = list(map(int, input().split()))
+    
+    ans: list = []
+    maxi = 0
+    cur = sum(arr)
+    for i in range(n):
+        if maxi > arr[i]:
+            ans.append(cur - arr[i] + maxi)
+        else:
+            ans.append(cur)
+        
+        maxi = max(maxi, arr[i])
+        cur -= arr[i]
+
+    print(*ans[::-1])

Other_Tasks/CF2104_C_Card_Game.py

@@ -0,0 +1,31 @@
+for _ in range(int(input())):
+    n = int(input())
+    a: set[int] = set()
+    b: set[int] = set()
+    
+    x = list(input().strip())
+    
+    for i in range(n):
+        if x[i] == 'A':
+            a.add(i+1)
+        else:
+            b.add(i+1)
+    
+    if 1 in a and n in a:
+        print("Alice")
+    elif 1 in b and n in b:
+        print("Bob")
+    elif 1 in b and n in a and n-1 in b:
+        print("Bob")
+    elif 1 in b and n in a and n-1 in a:
+        print("Alice")
+    elif 1 in a and n in b and n-1 in b:
+        print("Bob")
+    
+    else:
+        assert 1 in a and n in b and n-1 in a
+        
+        if len(b) == 1:
+            print("Alice")
+        else:
+            print("Bob")

Other_Tasks/CF2104_D_Array_and_GCD.cpp

@@ -0,0 +1,66 @@
+#include <numeric>
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using vi = vector<int>;
+#define fast_cin()                    \
+    ios_base::sync_with_stdio(false); \
+    cin.tie(NULL);                    \
+    cout.tie(NULL);
+
+typedef long long ll;
+typedef vector<ll> vll;
+
+ll _sieve_size;
+bitset<10000010> bs;
+vll primes;
+
+// Able to handle 1e7 in < 1s
+void sieve(ll upperbound = (ll)1e7) {
+    _sieve_size = upperbound + 1;
+    bs.set();
+    bs[0] = bs[1] = 0;
+    for (ll i = 2; i <= _sieve_size; i++) {
+        if (bs[i]) {
+            for (ll j = i * i; j <= _sieve_size; j += i) {
+                bs[j] = 0;
+            }
+            primes.push_back(i);
+        }
+    }
+}
+
+void solve() {
+    int n;
+    cin >> n;
+    vector<ll> a(n);
+    for (auto &x : a) cin >> x;
+    sort(a.begin(), a.end());
+
+    ll required = accumulate(primes.begin(), primes.begin() + n, 0LL);
+    ll have = accumulate(a.begin(), a.end(), 0LL);
+
+    for (int i = 0; i < n; i++) {
+        if (have >= required) {
+            cout << i << endl;
+            return;
+        }
+        have -= a[i];
+        required -= primes[n - 1 - i];
+    }
+
+    cout << n - 1 << endl;
+    return;
+}
+
+int main() {
+    sieve(1e7);
+    int tc;
+    cin >> tc;
+    while (tc--) solve();
+
+    return 0;
+}

Other_Tasks/CF2104_E_Unpleasant_Strings.cpp

@@ -0,0 +1,62 @@
+#include <algorithm>
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using vi = vector<int>;
+#define fast_cin()                    \
+    ios_base::sync_with_stdio(false); \
+    cin.tie(NULL);                    \
+    cout.tie(NULL);
+
+int n, k;
+int main() {
+    cin >> n >> k;
+    vector<int> a(n);
+    for (auto &x : a) {
+        char c;
+        cin >> c;
+        x = c - 'a';
+    }
+
+    vector<int> dp(n + 1, -1);
+    vector<int> nexts(k, n);
+    dp[n] = 0;
+    for (int i = n - 1; i >= 0; i--) {
+        int idx =
+            distance(nexts.begin(), max_element(nexts.begin(), nexts.end()));
+        dp[i] = dp[nexts[idx]] + 1;
+        nexts[a[i]] = i;
+    }
+
+    vector<vector<int>> positions(k);
+    for (int i = 0; i < n; i++) {
+        positions[a[i]].push_back(i);
+    }
+
+    int q;
+    cin >> q;
+    while (q--) {
+        string s;
+        cin >> s;
+
+        // We iterate through the string by jumping via positions
+        int cur = -1;
+        for (auto &c : s) {
+            int char_idx = c - 'a';
+            auto it = upper_bound(positions[char_idx].begin(),
+                                  positions[char_idx].end(), cur);
+            if (it == positions[char_idx].end()) {
+                cur = n;
+            } else {
+                cur = *it;
+            }
+        }
+
+        cout << (dp[cur]) << endl;
+    }
+
+    return 0;
+}