ABC91-ABC95

Author: IsHYuhi

ABC/ABC091/A.py

@@ -0,0 +1,6 @@
+a, b, c = map(int, input().split())
+
+if a+b>=c:
+    print('Yes')
+else:
+    print('No')

ABC/ABC091/B.py

@@ -0,0 +1,12 @@
+from collections import Counter
+n = int(input())
+s = Counter([input() for _ in range(n)])
+
+m = int(input())
+t = Counter([input() for _ in range(m)])
+
+keys = s.keys() & t.keys()
+for key in keys:
+    s[key] -= t[key]
+
+print(max(max(s.values()), 0))

ABC/ABC092/A.py

@@ -0,0 +1,6 @@
+a = int(input())
+b = int(input())
+c = int(input())
+d = int(input())
+
+print(min(a,b)+min(c,d))

ABC/ABC092/B.py

@@ -0,0 +1,8 @@
+n = int(input())
+d, x = map(int, input().split())
+a = [int(input()) for _ in range(n)]
+ans = 0
+for ai in a:
+    ans += (d-1)//ai + 1
+
+print(x+ans)

ABC/ABC092/C.py

@@ -0,0 +1,12 @@
+n = int(input())
+a = list(map(int, input().split()))
+a = [0] + a + [0]
+total = 0
+pre = 0
+
+for i in a:
+    total += abs(i-pre)
+    pre = i
+
+for i in range(1, len(a)-1):
+    print(total + abs(a[i+1]-a[i-1]) - abs(a[i]-a[i+1]) - abs(a[i]-a[i-1]))

ABC/ABC093/A.py

@@ -0,0 +1,6 @@
+from collections import Counter
+s = Counter(list(input()))
+if len(s)==3:
+    print('Yes')
+else:
+    print('No')

ABC/ABC093/B.py

@@ -0,0 +1,6 @@
+#PyPy3
+a, b, k = map(int, input().split())
+
+for i in range(a, b+1):
+    if i<=a+k-1 or b-k+1<=i:
+        print(i)

ABC/ABC093/C.py

@@ -0,0 +1,20 @@
+from collections import Counter
+abc = list(map(int, input().split()))
+
+ans = 0
+m = max(abc)
+for i in range(len(abc)):
+    count = (m-abc[i])//2
+    ans += count
+    abc[i] = abc[i]+2*count
+
+abc = Counter(abc)
+
+if len(abc)==1:
+    print(ans)
+else:
+    key = [k for k, v in abc.items() if v == 2][0]
+    if key == m:
+        print(ans+2)
+    else:
+        print(ans+1)

ABC/ABC094/A.py

@@ -0,0 +1,6 @@
+a, b, x = map(int, input().split())
+
+if a<=x<=a+b:
+    print('YES')
+else:
+    print('NO')

ABC/ABC094/B.py

@@ -0,0 +1,6 @@
+n, m, x = map(int, input().split())
+a = list(map(int, input().split()))
+root = [0]*n
+for i in a:
+    root[i] += 1
+print(min(sum(root[:x+1]), sum(root[x:])))

ABC/ABC094/C.py

@@ -0,0 +1,19 @@
+from operator import itemgetter
+n = int(input())
+x = list(map(int, input().split()))
+
+x = [(j, i) for i, j in enumerate(x)]
+x.sort(key=itemgetter(0))
+
+medi1 = x[len(x)//2][0]
+medi2 = x[len(x)//2-1][0]
+ans = [0]*n
+
+for i in range(len(x)):
+    if i<len(x)//2:
+        ans[x[i][1]] = medi1
+    else:
+        ans[x[i][1]] = medi2
+
+for a in ans:
+    print(a)

ABC/ABC095/A.py

@@ -0,0 +1,6 @@
+s = list(input())
+ans = 700
+for i in s:
+    if i == 'o':
+        ans += 100
+print(ans)

ABC/ABC095/B.py

@@ -0,0 +1,7 @@
+n, x = map(int, input().split())
+m = [int(input()) for _ in range(n)]
+m.sort()
+ans = len(m)
+x = x - sum(m)
+ans += x//m[0]
+print(ans)

ABC/ABC095/C.py

@@ -0,0 +1,10 @@
+a, b, c, x, y = map(int, input().split())
+
+if x==y:
+    each = 0
+elif x>y:
+    each = min(a, 2*c)*(x-y)
+else:
+    each = min(b, 2*c)*(y-x)
+
+print(min(min(x, y)*2*c+each, min(a, 2*c)*x + min(b, 2*c)*y))