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)

ABC/ABC055/B.py

@@ -0,0 +1,6 @@
+#PyPy3
+n = int(input())
+ans = 1
+for i in range(1,n+1):
+    ans = (ans*i)%1000000007
+print(ans)

ABC/ABC055/C.py

@@ -1,55 +1,6 @@
-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)
+s, c = map(int, input().split())
+ans = 0
+ans += min(s,c//2)
+res = c-min(s,c//2)*2
+ans += res//4
+print(ans)

ABC/ABC173/A.py

@@ -0,0 +1,4 @@
+import math
+n = int(input())
+
+print(abs(n-math.ceil(n/1000)*1000))

ABC/ABC173/B.py

@@ -0,0 +1,13 @@
+from collections import Counter
+n = int(input())
+
+S = [input() for i in range(n)]
+S = Counter(S)
+
+li = ['AC', 'WA', 'TLE', 'RE']
+
+for i in li:
+    if S.get(i):
+        print(i+' x '+str(S[i]))
+    else:
+        print(i+' x '+str(0))

ABC/ABC173/C.py

@@ -0,0 +1,17 @@
+h, w, k = map(int,input().split())
+
+field = [list(input()) for i in range(h)]
+
+ans = 0
+for maskr in range(0, 1<<h):#1のhビット左シフト2^h
+    for maskc in range(0, 1<<w):
+        black = 0
+        for i in range(h):
+            for j in range(w):
+                if ((maskr>>i) & 1) == 0 and ((maskc>>j) & 1) == 0 and field[i][j] == '#':
+                    #mask>>i: maskrのiビット右シフト2^(-i), つまりi番目が1じゃない(赤く塗られていない)かどうかを調べている
+                    #赤く塗られていないかつ、#ならblackとしてカウント, 2^h * 2^w　通り、つまり2^(h+w)通り全探索している
+                    black +=1
+        if black == k:
+            ans += 1
+print(ans)

ABC/ABC173/D.py

@@ -0,0 +1,10 @@
+from collections import deque
+n = int(input())
+a = list(map(int, input().split()))
+
+a.sort()
+ans = 0
+#最大値が1回, それ以降は大きい順に2回ずつ関わる.
+for i in range(1, n):
+    ans += a[n-i//2-1]
+print(ans)