add program

Author: IsHYuhi

Diff for: ABC/ABC006/C.py

@@ -0,0 +1,54 @@
+import itertools
+N, M = map(int, input().split())
+
+def combi(t):
+    for i in range(0,N+1):
+        c = M - i*4 - t*3
+        if c%2 != 0 or c<0:
+            continue
+        else:
+            c = c//2
+        if c+t+i== N:
+            print(c, t, i)
+            exit()
+    return
+
+combi(0)
+combi(1)
+print(-1, -1, -1)
+
+
+
+# l1 = [i for i in range(1, min(M//2, N)+1)]
+# l2 = [i for i in range(1, min(M//3, N)+1)]
+# l3 = [i for i in range(1, min(M//4, N)+1)]
+# p = itertools.product(l1, l2, l3)
+
+# for i in p:
+#     if i[0]*2 + i[1]*3 + i[2]*4 == M and sum(i)<=N:
+#         print(i[0], i[1], i[2])
+#         exit()
+# print(-1, -1, -1)
+
+
+
+
+# def dfs(i, j, k):
+#     if i+j+k <= N:
+#         if i*2 + j*3 + k*4 == M:
+#             print(i, j, k)
+#             exit()
+#         else:
+#             return False
+#     else:
+#         _ = dfs(i+1, j, k)
+#         _ = dfs(i, j, k+1)
+#     return False
+
+# print (b, t, f)
+# if dfs(0, 0, 0)==False:
+#     if dfs(0, 1, 0)==False:
+#         print(-1, -1, -1)
+
+
+

Diff for: ABC/ABC008/A.py

@@ -0,0 +1,2 @@
+S, T = map(int, input().split())
+print(T-S+1)

Diff for: ABC/ABC008/B.py

@@ -0,0 +1,5 @@
+from collections import Counter
+N = int(input())
+S = [input() for i in range(N)]
+S = Counter(S)
+print(max(S, key=S.get))

Diff for: ABC/ABC010/A.py

@@ -0,0 +1 @@
+print(input()+"pp")

Diff for: ABC/ABC010/B.py

@@ -0,0 +1,10 @@
+n = int(input())
+a = list(map(int, input().split()))
+
+ans = 0
+for i in a:
+    while i%3==2 or i%2==0:
+        i -= 1
+        ans += 1
+print(ans)
+

Diff for: ABC/ABC010/C.py

@@ -0,0 +1,23 @@
+import math
+txa, tya, txb, tyb, t, v = map(int, input().split())
+n = int(input())
+xy = [tuple(map(int,input().split())) for i in range(n)]
+dis_a = [(x-txa, y-tya) for x, y in xy]
+dis_b = [(txb-x, tyb-y) for x, y in xy]
+# l_a = []
+# l_b = []
+l = []
+for (x, y), (xb, yb) in zip(dis_a, dis_b):
+    # l_a.append(math.sqrt(x**2 + y**2))
+    # l_b.append(math.sqrt(xb**2 + yb**2))
+    l.append(math.sqrt(x**2 + y**2)+math.sqrt(xb**2 + yb**2))
+# print(l_a)
+# print(l_b)
+# print(l)
+# print(dis_a)
+# print(xy)
+for length in l:
+    if length <= v*t:
+        print('YES')
+        exit()
+print('NO')

Diff for: ABC/ABC015/C.py

@@ -0,0 +1,17 @@
+N, K = map(int, input().split())
+T = [list(map(int, input().split()))for i in range(N)]
+
+def dfs(i, x):
+    if i == N:
+        if x == 0:
+            return True
+    else:
+        for k in range(K):
+            if dfs(i+1, x ^ T[i][k]):
+                return True
+        return False
+
+if dfs(0, 0):
+    print("Found")
+else:
+    print("Nothing")

Diff for: ABC/ABC171/D.py

@@ -0,0 +1,29 @@
+from collections import Counter
+#import numpy as np
+N = int(input())
+A = list(map(int, input().split()))
+Q = int(input())
+ans = sum(A)
+A = Counter(A)
+bc = [tuple(map(int, input().split())) for i in range(Q)]
+# print(A)
+# print(A.items())
+for b, c in bc:
+    v = A.pop(b, None)
+    if v:
+        A[c] += v
+    #ans = sum(lambda x: x[0]*x[1], A.items())
+    #ans = sum(i*j for i, j in A.items())
+        ans = ans+((c-b)*v)
+    #ans = sum(A.items(), key=lambda x: x[0]*x[1])
+    #print(b, c)
+    #print(A)
+    print(ans)
+
+
+# #A = np.asarray(A)
+# for b, c in bc:
+#     A = np.where(A == b, c, A)
+#     # print('bc', b, c)
+#     # print('A', A)
+#     print(sum(A))