Add files via upload

Author: BrandonTang89

Other_Tasks/CF2074_A_Draw_a_Square.py

@@ -0,0 +1,3 @@
+for _ in range(int(input())):
+    x = list(map(int, input().split()))
+    print("Yes" if all([x[0] == y for y in x]) else "No")

Other_Tasks/CF2074_B_The_Third_Side.py

@@ -0,0 +1,4 @@
+for _ in range(int(input())):
+    n = int(input())
+    x = list(map(int, input().split()))
+    print(sum(x) - len(x) + 1)

Other_Tasks/CF2074_C_XOR_and_Triangle.cpp

@@ -0,0 +1,46 @@
+#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 x;
+        cin >> x;
+        int total_length = 32 - __builtin_clz(x);
+        int pc = __builtin_popcount(x);
+        if (pc == 1 || pc == total_length) {
+            cout << -1 << endl;
+            continue;
+        }
+
+        // negation and we change a zero to one
+        int ans = 0;
+        for (int i = 0; i < total_length; i++) {
+            if (!(x & (1 << i))) {
+                ans |= (1 << i);
+            }
+        }
+
+        for (int i = 0; i < total_length; i++) {
+            if (!(ans & (1 << i))){
+                ans |= (1 << i);
+                break;
+            }
+        }
+
+        cout << ans << endl;
+        assert((x + ans) > x^ans);
+        assert((x ^ ans) + ans > x);
+        assert((x ^ ans) + x > ans);
+    }
+
+    return 0;
+}

Other_Tasks/CF2074_D_Counting_Points.cpp

@@ -0,0 +1,64 @@
+#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);
+
+ll isqrt(ll n) {
+    ll hi = n < 1e8 ? n : 1e8;
+    ll lo = 0;
+    while (lo < hi) {
+        ll mid = (hi + lo + 1) / 2;
+        if (mid * mid <= n) {
+            lo = mid;
+        } else {
+            hi = mid - 1;
+        }
+    }
+    return lo;
+}
+
+int main() {
+    fast_cin();
+    int tc;
+    cin >> tc;
+
+    while (tc--) {
+        unordered_map<ll, ll> cnt;
+        ll n, m;
+        cin >> n >> m;
+        vector<ll> a(n);
+        for (ll& x : a) {
+            cin >> x;
+        }
+        vector<ll> r(n);
+        for (ll& x : r) {
+            cin >> x;
+        }
+
+        for (int i = 0; i < n; i++) {
+            ll center = a[i];
+            ll rad = r[i];
+
+            for (ll x = center - rad; x <= center + rad; x++) {
+                ll s = isqrt(rad * rad - (x - center) * (x - center));
+                cnt[x] = max(cnt[x], s * 2 + 1);
+            }
+        }
+
+        ll ans = 0;
+        for (auto& [k, v] : cnt) {
+            ans += v;
+        }
+
+        cout << ans << endl;
+    }
+
+    return 0;
+}