ABC031-041

Author: IsHYuhi

ABC/ABC006/D.py

@@ -0,0 +1,23 @@
+from bisect import bisect_left
+n = int(input())
+c = [int(input()) for _ in range(n)]
+
+dp = [float('inf')] * n
+
+for i in range(n):
+    dp[bisect_left(dp, c[i])] = c[i]
+print(n - bisect_left(dp, float('inf')))
+
+
+'''O(n^2) TLE'''
+# dp = [0]*(n+1)
+
+# res = 0
+# for i in range(n):
+#     dp[i] = 1
+#     for j in range(n):
+#         if c[j] < c[i]:
+#             dp[i] = max(dp[i], dp[j]+1)
+#         res = max(dp[i], res)
+# print(n-res)
+

ABC/ABC031/A.py

@@ -0,0 +1,5 @@
+a, d = map(int, input().split())
+if a<=d:
+    print((a+1)*d)
+else:
+    print((d+1)*a)

ABC/ABC031/B.py

@@ -0,0 +1,10 @@
+l, h = map(int, input().split())
+n = int(input())
+times = [int(input()) for _ in range(n)]
+for t in times:
+    if t <= l:
+        print(l-t)
+    elif l <= t <= h:
+        print(0)
+    elif h <= t:
+        print(-1)

ABC/ABC032/A.py

@@ -0,0 +1,7 @@
+a = int(input())
+b = int(input())
+n = int(input())
+for i in range(n, 1000000):
+    if(i%a==0 and i%b==0):
+        print(i)
+        exit()

ABC/ABC032/B.py

@@ -0,0 +1,9 @@
+s = input()
+k = int(input())
+ans = 0
+words = set()
+for i in range(len(s)-k+1):
+    if s[i:i+k] not in words:
+        ans+=1
+        words.add(s[i:i+k])
+print(ans)

ABC/ABC033/A.py

@@ -0,0 +1,5 @@
+N = input()
+if N[0]==N[1]==N[2]==N[3]:
+    print("SAME")
+else:
+    print("DIFFERENT")

ABC/ABC033/B.py

@@ -0,0 +1,14 @@
+n = int(input())
+s = []
+r = []
+for _ in range(n):
+    _s, _r = input().split()
+    s.append(_s)
+    r.append(int(_r))
+total = sum(r)//2
+
+for i in range(n):
+    if r[i]>total:
+        print(s[i])
+        exit()
+print('atcoder')

ABC/ABC033/C.py

@@ -0,0 +1,7 @@
+s = list(input().split('+'))
+ans =0
+for i in s:
+    each = i.split('*')
+    if '0' not in each:
+        ans+=1
+print(ans)

ABC/ABC034/A.py

@@ -0,0 +1,5 @@
+x, y = map(int, input().split())
+if x<y:
+    print('Better')
+else:
+    print('Worse')

ABC/ABC034/B.py

@@ -0,0 +1,5 @@
+n = int(input())
+if n%2==0:
+    print(n-1)
+else:
+    print(n+1)

ABC/ABC035/A.py

@@ -0,0 +1,6 @@
+w, h = map(int, input().split())
+
+if w/h == 4/3:
+    print('4:3')
+else:
+    print('16:9')

ABC/ABC035/B.py

@@ -0,0 +1,29 @@
+from collections import Counter
+s = input()
+t = int(input())
+
+s = Counter(s)
+move = ['L', 'R', 'U', 'D']
+x = y = 0
+for d in move:
+    if s.get(d):
+        if d == 'L':
+            x -= s.get(d)
+        elif d == 'R':
+            x += s.get(d)
+        elif d == 'U':
+            y += s.get(d)
+        elif d == 'D':
+            y -= s.get(d)
+
+if s.get('?'):
+    q = s.get('?')
+if t==1:
+    print(abs(x)+abs(y)+q)
+else:
+    if 0<abs(x)+abs(y)<q:
+        print((q-(abs(x)+abs(y)))%2)
+    elif 0 == abs(x)+abs(y):
+        print((q%2))
+    else:
+        print(abs(x)+abs(y)-q)

ABC/ABC036/A.py

@@ -0,0 +1,4 @@
+import math
+a, b = map(int, input().split())
+
+print(math.ceil(b/a))

ABC/ABC036/B.py

@@ -0,0 +1,7 @@
+n = int(input())
+
+field = [list(input()) for _ in range(n)]
+for i in range(n):
+    for j in reversed(range(n)):
+        print(field[j][i], end='')
+    print('')

ABC/ABC037/A.py

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

ABC/ABC037/B.py

@@ -0,0 +1,9 @@
+n, q = map(int, input().split())
+lrt = [list(map(int, input().split())) for _ in range(q)]
+sequence = [0]*n
+
+for l, r, t in lrt:
+    sequence[l-1:r] = [t]*(r-l+1)
+
+for i in sequence:
+    print(i)

ABC/ABC038/A.py

@@ -0,0 +1,6 @@
+s = input()
+
+if s[-1]=='T':
+    print('YES')
+else:
+    print('NO')

ABC/ABC038/B.py

@@ -0,0 +1,7 @@
+h1, w1 = map(int, input().split())
+h2, w2 = map(int, input().split())
+
+if h1==h2 or w1==h2 or w2==h1 or w1==w2:
+    print('YES')
+else:
+    print('NO')

ABC/ABC039/A.py

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

ABC/ABC039/B.py

@@ -0,0 +1,2 @@
+x = int(input())
+print(int(x**(1/4)))

ABC/ABC039/C.py

@@ -0,0 +1,17 @@
+from collections import Counter
+onkai_m = ['Mi', 'Fa', 'So', 'La', 'Si', 'Do', 'Re'][::-1]
+onkai_s = [ 'Si', 'Do', 'Re', 'Mi', 'Fa', 'So', 'La'][::-1]
+
+s = input()
+for i in range(20-1):
+    if s[i:i+2] == 'WW':
+        index = i+1
+        break
+num = Counter(s[index:index+6])
+
+w_num = Counter(s[:index-1])
+w_num = w_num['W']
+if num['B']==3:
+    print(onkai_m[w_num-1])
+elif num['B']==2:
+    print(onkai_s[w_num-1])

ABC/ABC040/A.py

@@ -0,0 +1,3 @@
+n , x = map(int, input().split())
+
+print(min(n-x, x-1))

ABC/ABC040/B.py

@@ -0,0 +1,12 @@
+import math
+n = int(input())
+
+
+x, y = 0, 0
+ans = float('inf')
+for i in range(1, n+1):
+    for j in range(i, n+1):
+        if i*j>n:
+            break
+        ans = min(ans, n-i*j+abs(i-j))
+print(ans)

ABC/ABC041/A.py

@@ -0,0 +1,3 @@
+s = input()
+i = int(input())
+print(s[i-1])

ABC/ABC041/B.py

@@ -0,0 +1,3 @@
+a, b, c = map(int, input().split())
+
+print(a*b*c%(10**9+7))

ABC/ABC041/C.py

@@ -0,0 +1,7 @@
+n = int(input())
+a = list(map(int, input().split()))
+b = [i for i in range(1, n+1)]
+c = zip(a, b)
+c = sorted(c, reverse=True, key=lambda x: x[0])
+for _, i in c:
+    print(i)