🎨

Author: reo11

atcoder/ARC/arc171/a.py

@@ -0,0 +1,23 @@
+import math
+
+t = int(input())
+
+def solve(n, a, b):
+    flag = True
+    if a > n:
+        flag = False
+    n -= a
+    if b > n * math.ceil(n / 2):
+        flag = False
+    if flag:
+        return "Yes"
+    else:
+        return "No"
+
+ans = []
+
+for _ in range(t):
+    n, a, b = map(int, input().split())
+    ans.append(solve(n, a, b))
+
+print(*ans, sep="\n")

atcoder/abc/abc301-400/abc339/f_easy.py

@@ -0,0 +1,19 @@
+from collections import defaultdict
+
+n = int(input())
+a = [int(input()) for _ in range(n)]
+
+counter = defaultdict(int)
+for ai in a:
+    counter[ai] += 1
+
+ans = 0
+for i in range(n):
+    for j in range(i, n):
+        aij = a[i] * a[j]
+        if aij in counter:
+            if i == j:
+                ans += counter[aij]
+            else:
+                ans += counter[aij] * 2
+print(ans)

atcoder/abc/abc301-400/abc339/f_explain.cpp

@@ -0,0 +1,61 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+using ll = long long;
+using P = pair<ll, ll>;
+
+const ll infll = (1LL << 62) - 1;
+const int inf = (1 << 30) - 1;
+
+struct IoSetup {
+    IoSetup() {
+        cin.tie(nullptr);
+        ios::sync_with_stdio(false);
+        cout << fixed << setprecision(10);
+        cerr << fixed << setprecision(10);
+    }
+} iosetup;
+
+template< typename T1, typename T2 >
+inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
+
+template< typename T1, typename T2 >
+inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
+
+void fail() {
+    cout << -1 << endl;
+    exit(0);
+}
+
+int modulo(string s, int mod) {
+    int res = 0;
+    for (int i = 0; i < s.size(); i++) {
+        res = (res * 10 + s[i] - '0') % mod;
+    }
+    return res;
+}
+
+
+int main(){
+    cin >> n;
+    vector<int> a(n);
+    for (int i = 0; i < n; i++) cin >> a[i];
+
+    int mod = 10000007;
+    vector<int> mod_a(n);
+    std::map<int, int> mp;
+    for (int i = 0; i < n; i++) {
+        int a_mod = a[i] % mod;
+        mod_a[i] = a_mod;
+        mp[a_mod]++;
+    }
+
+    int ans = 0;
+    for (int i = 0; i < n; i++){
+        for(int j = 0; j < n; j++){
+            int mod_aij = (mod_a[i] * mod_a[j]) % mod;
+            ans += mp[mod_aij];
+        }
+    }
+    count << ans << endl;
+}

atcoder/abc/abc301-400/abc339/g.py

@@ -1,3 +1,47 @@
+from bisect import bisect
+from heapq import merge
+
+class MergeSortTree:
+    def __init__(self, N, A):
+        self.tree_size = 2**(N-1).bit_length()
+        self.tree = [None]*(2*self.tree_size)
+        for i, a in enumerate(A):
+            self.tree[self.tree_size-1+i] = [a]
+        for i in range(N, self.tree_size):
+            self.tree[self.tree_size-1+i] = []
+        for i in range(self.tree_size-2, -1, -1):
+            *self.tree[i], = merge(self.tree[2*i+1], self.tree[2*i+2])
+
+    # count elements A_i s.t. A_i <= k for i in [l, r)
+    def query1(self, l, r, k):
+        L = l + self.tree_size
+        R = r + self.tree_size
+        s = 0
+        while L < R:
+            if R & 1:
+                R -= 1
+                s += bisect(self.tree[R-1], k-1)
+            if L & 1:
+                s += bisect(self.tree[L-1], k-1)
+                L += 1
+            L >>= 1; R >>= 1
+        return s
+
+    # count elements A_i s.t. a <= A_i < b for i in [l, r)
+    def query(self, l, r, a, b):
+        L = l + self.tree_size
+        R = r + self.tree_size
+        s = 0
+        while L < R:
+            if R & 1:
+                R -= 1
+                s += bisect(self.tree[R-1], b-1) - bisect(self.tree[R-1], a-1)
+            if L & 1:
+                s += bisect(self.tree[L-1], b-1) - bisect(self.tree[L-1], a-1)
+                L += 1
+            L >>= 1; R >>= 1
+        return s
+
 n = int(input())
 a = list(map(int, input().split()))
 q = int(input())
@@ -12,6 +56,8 @@ def decode(alpha, beta, gamma, pre_b):
     x = gamma ^ pre_b
     return l, r, x
 
+
+
 ans = []
 pre_b = 0
 for query in queries: