ABC188-ABC195

Author: IsHYuhi

ABC/ABC188/A.py

@@ -0,0 +1,6 @@
+x, y = map(int, input().split())
+
+if min(x, y) + 3 >max(x, y):
+    print('Yes')
+else:
+    print('No')

ABC/ABC188/B.py

@@ -0,0 +1,10 @@
+import numpy as np
+
+n = int(input())
+a = np.array(list(map(int, input().split())))
+b = np.array(list(map(int, input().split())))
+
+if not np.sum(a*b):
+    print('Yes')
+else:
+    print('No')

ABC/ABC188/C.py

@@ -0,0 +1,4 @@
+n = int(input())
+a = list(map(int, input().split()))
+
+print(a.index(min(max(a[:2**(n-1)]), max(a[2**(n-1):]))) + 1)

ABC/ABC189/A.py

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

ABC/ABC189/B.py

@@ -0,0 +1,10 @@
+n, x = map(int, input().split())
+vp = [list(map(int, input().split())) for _ in range(n)]
+total = 0
+for i in range(n):
+    v, p = vp[i]
+    total += v*p
+    if total>x*100:
+        print(i+1)
+        exit()
+print(-1)

ABC/ABC189/C.py

@@ -0,0 +1,36 @@
+n = int(input())
+a = list(map(int, input().split()))
+
+def split_array(a, key):
+    n = len(a)
+    l, r = 0, 0
+    new = []
+    i = 0
+    while i<n:
+        if a[i]==key:
+            r = i
+            if l!=r:
+                new.append(a[l:r])
+                l = r+1
+
+            else:
+                l += 1
+        i += 1
+
+    if a[n-1]!=key:
+        new.append(a[l:n])
+
+    return new
+
+def dfs(a):
+    if len(a)<=1:
+        return min(a)
+    min_a = min(a)
+    max_a = min_a*len(a)
+    for na in split_array(a, min_a):
+        r = dfs(na)
+        if r > max_a:
+            max_a = r
+    return max_a
+
+print(dfs(a))

ABC/ABC190/A.py

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

ABC/ABC190/B.py

@@ -0,0 +1,8 @@
+n, s, d = map(int, input().split())
+
+ans = 'No'
+for _ in range(n):
+    x, y = map(int, input().split())
+    if x<s and y>d:
+        ans = 'Yes'
+print(ans)

ABC/ABC190/C.py

@@ -0,0 +1,28 @@
+n, m = map(int, input().split())
+ab = [list(map(int, input().split())) for _ in range(m)]
+k = int(input())
+cd = [list(map(int, input().split())) for _ in range(k)]
+
+def check(dishes):
+    count = 0
+    fill = [0]*n
+    for i in dishes:
+        fill[i-1] = 1
+    for a, b in ab:
+        if fill[a-1] and fill[b-1]:
+            count += 1
+    return count
+
+
+def dfs(li, i):
+    if i >= k:
+        return check(li)
+
+    left = dfs(li+[cd[i][0]], i+1)
+    right = dfs(li+[cd[i][1]], i+1)
+
+    ans = max(left, right)
+
+    return ans
+
+print(dfs([], 0))

ABC/ABC191/A.py

@@ -0,0 +1,6 @@
+v, t, s, d = map(int, input().split())
+
+if v*t <= d <= v*s:
+    print('No')
+else:
+    print('Yes')

ABC/ABC191/B.py

@@ -0,0 +1,6 @@
+import numpy as np
+n, x = map(int, input().split())
+a = list(map(int, input().split()))
+a = [str(i) for i in a if i != x]
+
+print(' '.join(a))

ABC/ABC192/A.py

@@ -0,0 +1,2 @@
+x = int(input())
+print(100-x%100)

ABC/ABC192/B.py

@@ -0,0 +1,14 @@
+s = input()
+s1 = s[::2]
+s2 = s[1::2]
+for i, l in enumerate(s, 1):
+
+    if i%2==1 and (ord('a')<=ord(l)<=ord('z')):
+        continue
+    elif i%2==0 and (ord('A')<=ord(l)<=ord('Z')):
+        continue
+    else:
+        print('No')
+        exit()
+
+print('Yes')

ABC/ABC192/C.py

@@ -0,0 +1,14 @@
+n, k = map(str, input().split())
+k = int(''.join(k))
+
+def g1(x):
+    return int(''.join(sorted(x, reverse=True)))
+
+def g2(x):
+    return int(''.join(sorted(x)))
+
+next = str(n)
+for i in range(k):
+    next = list(str(g1(next)-g2(next)))
+
+print(''.join(next))

ABC/ABC193/A.py

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

ABC/ABC193/B.py

@@ -0,0 +1,9 @@
+n = int(input())
+apx = [list(map(int, input().split())) for _ in range (n)]
+m = float('inf')
+for a, p, x in apx:
+    if x-a > 0:
+        m = min(m, p)
+
+m = -1 if m == float('inf') else m
+print(m)

ABC/ABC193/C.py

@@ -0,0 +1,10 @@
+n = int(input())
+expressed = set()
+
+for i in range(2, int(n**0.5)+1):
+    k = i*i
+    while k <= n:
+        expressed.add(k)
+        k *= i
+
+print(n-len(expressed))

ABC/ABC194/A.py

@@ -0,0 +1,11 @@
+a, b  = map(int, input().split())
+
+if a+b>=15 and b>=8:
+    print(1)
+elif a+b>=10 and b>=3:
+    print(2)
+elif a+b>=3:
+    print(3)
+else:
+    print(4)
+

ABC/ABC194/B.py

@@ -0,0 +1,8 @@
+n = int(input())
+
+ab = [list(map(int, input().split())) for _ in range(n)]
+ab.sort(key=lambda x: x[0])
+a, b = ab.pop(0)
+ab.sort(key=lambda x: x[1])
+_, c = ab.pop(0)
+print(min(a+b, max(a,c)))

ABC/ABC194/C.py

@@ -0,0 +1,11 @@
+from collections import Counter
+n = int(input())
+a = Counter(list(map(int, input().split())))
+a = [[i, j] for i, j in a.items()]
+
+ans = 0
+for i in range(len(a)):
+    for j in range(i, len(a)):
+        ans += (a[i][1]*a[j][1])*(a[i][0]-a[j][0])**2
+
+print(ans)

ABC/ABC195/A.py

@@ -0,0 +1,6 @@
+m, h = map(int, input().split())
+
+if h%m==0:
+    print('Yes')
+else:
+    print('No')

ABC/ABC195/B.py

@@ -0,0 +1,10 @@
+a, b, w = map(int, input().split())
+w = w*1000
+
+if a+(w%a)/(w//a)<= b:
+    r = 1 if w%b != 0 else 0
+    print(w//b+r, w//a)
+
+else:
+    print('UNSATISFIABLE')
+

ABC/ABC195/C.py

@@ -0,0 +1,8 @@
+import math
+n = int(input())
+p = int(math.log10(n))
+ans = 0
+for i in range(3, 16, 3):
+    if p>=i:
+        ans += n-10**i+1
+print(ans)