add ABC

Author: IsHYuhi

ABC/ABC026/A.py

@@ -0,0 +1,3 @@
+import math
+N = int(input())
+print((N//2)*math.ceil(N/2))

ABC/ABC026/B.py

@@ -0,0 +1,13 @@
+import math
+N = int(input())
+R = []
+for i in range(N):
+    R.append(int(input()))
+R.sort(reverse=True)
+ans = 0
+for i, r in enumerate(R):
+    if i%2==0:
+        ans += r*r*math.pi
+    else:
+        ans -= r*r*math.pi
+print(ans)

ABC/ABC026/C.py

@@ -0,0 +1,20 @@
+n = int(input())
+table = [[] for i in range(n+1)]
+
+for i in range(2,n+1):
+    j = int(input())
+    table[j].append(i)
+
+def dfs(chi):
+    _max = 0
+    _min = float('inf')
+    if not chi:
+        return 1
+
+    for j in chi:
+        num = dfs(table[j])
+        _max = max(_max, num)
+        _min = min(_min, num)
+    return _max+_min+1
+
+print(dfs(table[1]))

ABC/ABC027/A.py

@@ -0,0 +1,10 @@
+l1, l2, l3 = map(int, input().split())
+
+if l1==l2:
+    print(l3)
+elif l1==l3:
+    print(l2)
+elif l2==l3:
+    print(l1)
+else:
+    print(l1)

ABC/ABC027/B.py

@@ -0,0 +1,13 @@
+n = int(input())
+A = list(map(int, input().split()))
+if not sum(A)%n==0:
+    print(-1)
+    exit()
+
+basic = sum(A)//n
+ans = 0
+for i in range(n-1):
+    print(A[:i+1], A[i+1:],i+1, n-i-1, basic)
+    if not (sum(A[:i+1]) == basic*(i+1) and sum(A[i+1:]) == basic*(n-i-1)):
+        ans += 1
+print(ans)

ABC/ABC028/A.py

@@ -0,0 +1,10 @@
+n = int(input())
+
+if n <= 59:
+    print('Bad')
+elif n<=89:
+    print('Good')
+elif n<= 99:
+    print('Great')
+elif n ==100:
+    print('Perfect')

ABC/ABC028/B.py

@@ -0,0 +1,13 @@
+from collections import Counter
+S = list(input())
+S = Counter(S)
+
+abcdef = ['A', 'B', 'C', 'D', 'E', 'F']
+for a in abcdef:
+    if S.get(a):
+        print(S[a], end='')
+    else:
+        print(0, end='')
+    if a!='F':
+        print(' ', end='')
+print()

ABC/ABC028/C.py

@@ -0,0 +1,5 @@
+import itertools
+nums = list(map(int, input().split()))
+A = list(map(sum, itertools.combinations(nums, 3)))
+A.sort(reverse=True)
+print(A[2])

ABC/ABC028/D.py

@@ -0,0 +1,45 @@
+import itertools
+n, k = map(int, input().split())
+nums = [i for i in range(1, n+1)]
+
+nums = [1]
+for i in range(n-1):
+    nums.append(nums[-1]+3)
+#print(nums)
+ans = []
+alpha = 3
+for i, num in enumerate(nums[:-1]):
+    ans.append(num+(n-i-1)*alpha)
+    alpha += 6
+ans.append(nums[-1])
+#print(ans)
+print(ans[k-1]/sum(ans))
+
+##--------模範解答-------------[https://www.slideshare.net/chokudai/abc028]
+#print(((n-k)*(k-1)*6+(n-1)*3+1)/n**3)
+
+
+
+
+
+##法則チェック
+# print(nums)
+# nums = list(map(sorted,map(list,itertools.product(nums, repeat=3))))
+# c1, c2, c3, c4, c5, c6, c7 = 0, 0, 0, 0, 0, 0, 0
+# for i in nums:
+#     if i[1]==1:
+#         c1 += 1
+#     elif i[1]==2:
+#         c2 += 1
+#     elif i[1]==3:
+#         c3 += 1
+#     elif i[1]==4:
+#         c4 += 1
+#     elif i[1]==5:
+#         c5 += 1
+#     elif i[1]==6:
+#         c6 += 1
+#     elif i[1]==7:
+#         c7 +=1
+# print(c1, c2, c3, c4, c5, c6, c7)
+# print(nums)

ABC/ABC029/A.py

@@ -0,0 +1 @@
+print(input()+'s')

ABC/ABC029/B.py

@@ -0,0 +1,5 @@
+ans = 0
+for i in range(12):
+    if 'r' in input():
+        ans += 1
+print(ans)

ABC/ABC029/C.py

@@ -0,0 +1,7 @@
+import itertools
+n = int(input())
+abc = ['a', 'b', 'c']
+li = list(map(lambda x: ''.join(x),itertools.product(abc, repeat=n)))
+li.sort()
+for i in li:
+    print(i)

ABC/ABC030/A.py

@@ -0,0 +1,7 @@
+a, b, c, d = map(int, input().split())
+if b/a == d/c:
+    print('DRAW')
+elif b/a > d/c:
+    print('TAKAHASHI')
+else:
+    print('AOKI')

ABC/ABC030/B.py

@@ -0,0 +1,8 @@
+import math
+n, m = map(int, input().split())
+if n>=12:
+    n = n-12
+n = (60*n + m)/2
+m = 6*m
+ans = abs(m-n)
+print(min(ans, 360-ans))