ABC51-55

Author: IsHYuhi

ABC/ABC051/A.py

@@ -0,0 +1 @@
+print(input().replace(',', ' '))

ABC/ABC051/B.py

@@ -0,0 +1,9 @@
+from bisect import bisect
+k, s = map(int, input().split())
+ans = 0
+rekkyo = []
+for i in range(0,k+1):
+    for j in range(0,k+1):
+        if 0<=s-i-j<=k:
+            ans+=1
+print(ans)

ABC/ABC052/A.py

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

ABC/ABC052/B.py

@@ -0,0 +1,11 @@
+n = int(input())
+s = input()
+x = 0
+ans = 0
+for i in s:
+    if i=='I':
+        x+=1
+    elif i=="D":
+        x-=1
+    ans = max(ans, x)
+print(ans)

ABC/ABC053/A.py

@@ -0,0 +1,4 @@
+if int(input())<1200:
+    print('ABC')
+else:
+    print('ARC')

ABC/ABC053/B.py

@@ -0,0 +1,9 @@
+s = input()
+for i, st in enumerate(s):
+    if st=='A':
+        start = i
+        break
+for i, st in enumerate(s):
+    if st=='Z':
+        end = i
+print(end-start+1)

ABC/ABC053/C.py

@@ -0,0 +1,17 @@
+import math
+x = int(input())
+
+if x<=6:
+    print(1)
+elif x<=11:
+    print(2)
+else:
+    ans = (x//11)*2
+    res = (x%11)
+    if res==0:
+        res =0
+    elif res<=6:
+        res = 1
+    elif res<=11:
+        res = 2
+    print(ans+res)

ABC/ABC054/A.py

@@ -0,0 +1,11 @@
+A, B = map(int, input().split())
+if A==B:
+    print('Draw')
+elif A==1:
+    print('Alice')
+elif B==1:
+    print('Bob')
+elif A>B:
+    print('Alice')
+else:
+    print('Bob')

ABC/ABC054/C.py

@@ -0,0 +1,55 @@
+N, M = map(int, input().split())
+#ab = [list(map(int, input().split())) for i in range(M)]
+ab = [[] for _ in range(N)]
+
+for _ in range(M):
+    a, b = map(int,input().split())
+    ab[a-1].append(b-1)
+    ab[b-1].append(a-1)
+#print(ab)
+
+count = 0
+
+def dfs(i, now, done):
+    global count
+    if i == N-1:
+        count += 1
+        #print(now+1)
+        #print('-----')
+        return
+
+    for j in ab[now]:
+        #print(j, done)
+        if j not in done:
+            #print(j+1)
+            #done.append(j)
+            dfs(i+1, j, done + [j])##引数はバラして入れる！
+    return
+
+dfs(0, 0, [0])
+print(count)
+
+# import itertools
+
+# n, m = map(int, input().split())
+
+# path = [[False] * n for i in range(n)]
+# for i in range(m):
+#     a, b = map(int, input().split())
+#     a -= 1
+#     b -= 1
+#     path[a][b] = True
+#     path[b][a] = True
+
+# ans = 0
+
+# for i in itertools.permutations(range(n), n):#N!
+#     if i[0] == 0:
+#         for j in range(n):
+#             if j == n - 1:
+#                 ans += 1
+#                 break
+#             if not path[i[j]][i[j + 1]]:
+#                 break
+
+# print(ans)

ABC/ABC055/A.py

@@ -1,11 +1,2 @@
-A, B = map(int, input().split())
-if A==B:
-    print('Draw')
-elif A==1:
-    print('Alice')
-elif B==1:
-    print('Bob')
-elif A>B:
-    print('Alice')
-else:
-    print('Bob')
+n = int(input())
+print(n*800-(n//15)*200)