add ABCs

Author: IsHYuhi

ABC/ABC149/A.py

@@ -0,0 +1,2 @@
+s, t = input().split()
+print(t+s)

ABC/ABC149/B.py

@@ -0,0 +1,2 @@
+a, b, k = map(int, input().split())
+print(max(0, a-k), max(0, b-max(0, (k-a))))

ABC/ABC149/C.py

@@ -0,0 +1,19 @@
+import math
+
+def min_prime(start, limit):
+    for k in range(start, limit+1):
+
+        if k%2 == 0 and k !=2:
+            continue
+
+        factor = 0
+
+        for divisor in range(2, math.ceil(math.sqrt(k))):
+            if k % divisor == 0:
+                factor += 1
+
+        if factor == 0:
+            return k
+
+x = int(input())
+print(min_prime(x, 10**6))

ABC/ABC180/A.py

@@ -0,0 +1,2 @@
+n, a, b = map(int, input().split())
+print(n-a+b)

ABC/ABC180/B.py

@@ -0,0 +1,8 @@
+import math
+n = int(input())
+x = list(map(lambda x: abs(int(x)), input().split()))
+print(sum(x))
+mx = max(x)
+x = [i**2 for i in x]
+print(math.sqrt(sum(x)))
+print(mx)

ABC/ABC180/C.py

@@ -0,0 +1,17 @@
+import math
+n = int(input())
+
+def decomp(n):
+    ans = []
+    ans_ = []
+    for i in range(1, int(n**0.5)+1):
+        if n%i == 0:
+            ans.append(i)
+            if n//i != i:
+                ans_.append(n//i)
+            #if (n//i)*i==n:
+    return ans+ans_[::-1]
+
+ans = decomp(n)
+for i in ans:
+    print(i)

ABC/ABC185/A.py

@@ -0,0 +1,3 @@
+a, b, c, d = map(int, input().split())
+
+print(min(a, b, c, d))

ABC/ABC185/B.py

@@ -0,0 +1,21 @@
+max_n, m, t = map(int, input().split())
+n = max_n
+ab = [list(map(int, input().split())) for _ in range(m)]
+now = 0
+for i in range(m):
+
+    a, b = ab[i]
+    n = min(max_n, n-(a-now))
+    now = a
+    if n<=0:
+        print('No')
+        exit()
+    n = min(max_n, n+(b-now))
+    now = b
+
+if n-(t-now)<=0:
+
+    print('No')
+else:
+    print('Yes')
+

ABC/ABC185/C.py

@@ -0,0 +1,6 @@
+import math
+def combinations_count(n, r):
+    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
+
+l = int(input())
+print(combinations_count(l-1, 11))

ABC/ABC185/D.py

@@ -0,0 +1,32 @@
+from collections import deque
+n, m = map(int ,input().split())
+a = list(map(int, input().split()))
+if m == 0:
+    print(1)
+    exit()
+
+a = deque(sorted(a))
+va = []
+s = 0
+f = n
+a.append(n+1)
+m += 1
+mi = n
+for i in range(m):
+    if a[i]-s-1>0:
+        va.append(a[i]-s-1)
+        mi = min(a[i]-s-1, mi)
+    s = a[i]
+
+if not va:
+    print(0)
+    exit()
+
+#print(va)
+#mi = min(va)
+ans = 0
+
+for j in va:
+    r = 1 if j%mi > 0 else 0
+    ans += j//mi+r
+print(ans)

ABC/ABC186/A.py

@@ -0,0 +1,2 @@
+n, w = map(int, input().split())
+print(n//w)

ABC/ABC186/B.py

@@ -0,0 +1,13 @@
+h, w = map(int, input().split())
+
+field = [list(map(int, input().split())) for _ in range(h)]
+mn = 100
+for i in field:
+    mn = min(mn, min(i))
+
+ans = 0
+for i in range(h):
+    for j in range(w):
+        ans += abs(field[i][j]-mn)
+
+print(ans)

ABC/ABC186/C.py

@@ -0,0 +1,7 @@
+n = int(input())
+
+ans = 0
+for i in range(1, n+1):
+    if '7' not in str(i) and '7' not in str(oct(i))[2:]:
+        ans += 1
+print(ans)

ABC/ABC186/D.py

@@ -0,0 +1,40 @@
+import bisect
+n = int(input())
+a = list(map(int, input().split()))
+a.sort()
+total = sum(a)
+ans = 0
+for o, i in enumerate(a, 1):
+    total -= i
+    ans += abs(i*(n-o)-total)
+
+print(ans)
+
+# total = sum(a)
+# div = [total]
+# a = [[i, idx] for idx, i in enumerate(a)]
+# new_a = sorted(a, key=lambda x: x[0])
+# su = 0
+# for i, j in new_a:
+#     su += i
+#     div.append(total-su)
+
+# print(total)
+# print(new_a)
+# print(div)
+# ans = 0
+# new_a = sorted(new_a, key=lambda x: x[1], reverse=True)
+# off = 0
+# for i, j in new_a:
+#     l = j-1
+#     r = j
+#     # l = bisect.bisect_left(new_a, i)
+#     # r = bisect.bisect_right(new_a, i)
+#     # print(l, r)
+#     #print()
+#     ans += l*i-(total-div[l]) + div[r]-off-(n-l)*i
+#     off += div[l]
+#     #print(div[bisect.bisect_left(new_a, i)])
+#     #print()
+
+# print(ans)

ABC/ABC187/A.py

@@ -0,0 +1,11 @@
+a, b = map(str, input().split())
+
+sum_a = 0
+for i in a:
+    sum_a += int(i)
+
+sum_b = 0
+for i in b:
+    sum_b += int(i)
+
+print(max(sum_a, sum_b))

ABC/ABC187/B.py

@@ -0,0 +1,14 @@
+n = int(input())
+xy = [list(map(int, input().split())) for _ in range(n)]
+l = len(xy)
+ans = 0
+for i in range(l):
+    xi, yi = xy[i][0], xy[i][1]
+    for j in range(i+1, l):
+        xj, yj = xy[j][0], xy[j][1]
+
+        a = abs((yi-yj)/(xi-xj))
+        if a <= 1:
+            ans += 1
+
+print(ans)

ABC/ABC187/C.py

@@ -0,0 +1,18 @@
+n = int(input())
+ss = [input() for _ in range(n)]
+
+wo = dict()
+ex = dict()
+for s in ss:
+    if s[0]== '!':
+        ex[s[1:]] = True
+
+    else:
+        wo[s] = True
+
+keys = set(wo.keys()) & set(ex.keys())
+
+if keys:
+    print(list(keys)[0])
+else:
+    print('satisfiable')

ABC/ABC187/D.py

@@ -0,0 +1,14 @@
+n = int(input())
+diff = []
+result = 0
+for i in range(n):
+    a, b = map(int, input().split())
+    diff.append(2*a+b)
+    result -= a
+
+diff.sort(reverse=True)
+i = 0
+while result<=0:
+    result += diff[i]
+    i += 1
+print(i)

ARC/ARC024/A.py

@@ -0,0 +1,12 @@
+from collections import Counter
+l, r = map(int, input().split())
+ls = Counter(list(map(int, input().split())))
+rs = Counter(list(map(int, input().split())))
+
+keys = set(ls.keys()) & set(rs.keys())
+
+ans = 0
+for key in keys:
+    ans += min(ls[key], rs[key])
+
+print(ans)