add ABC145-ABC148

Author: IsHYuhi

ABC/ABC145/A.py

@@ -0,0 +1,2 @@
+r = int(input())
+print(r**2)

ABC/ABC145/B.py

@@ -0,0 +1,7 @@
+n = int(input())
+s = input()
+
+if len(s)%2==0 and s[:len(s)//2]==s[len(s)//2:]:
+    print('Yes')
+else:
+    print('No')

ABC/ABC145/C.py

@@ -0,0 +1,13 @@
+import math
+
+n = int(input())
+towns = [list(map(int, input().split())) for _ in range(n)]
+ans = 0
+c = 0
+for i in range(n-1):
+    x1, y1 = towns[i]
+    for j in range(i+1, n):
+        x2, y2 = towns[j]
+        ans += math.sqrt((x1-x2)**2 + (y1-y2)**2)*(n-1)*2
+
+print(ans/((n-1)*n))

ABC/ABC146/A.py

@@ -0,0 +1,5 @@
+day = ['SUN','MON','TUE','WED','THU','FRI','SAT']
+s = input()
+for i in range(7):
+    if s == day[i]:
+        print(7-i)

ABC/ABC146/B.py

@@ -0,0 +1,8 @@
+n = int(input())
+s = input()
+for i in s:
+    c = ord(i)+n
+    if c >= 91:
+        c = c-26
+    print(chr(c), end='')
+print()

ABC/ABC146/C.py

@@ -0,0 +1,16 @@
+a, b, x = map(int, input().split())
+
+def binary_search(a, b, x):
+    left = 1
+    right = 10**9
+    while left<=right:
+        mid = (left+right)//2
+        if x == a*mid+b*int(len(str(mid))):
+            return mid
+        elif x<a*mid+b*int(len(str(mid))):
+            right = mid-1
+        else:
+            left = mid+1
+    return right
+
+print(binary_search(a, b, x))

ABC/ABC147/A.py

@@ -0,0 +1,5 @@
+a = list(map(int, input().split()))
+if sum(a)>=22:
+    print('bust')
+else:
+    print('win')

ABC/ABC147/B.py

@@ -0,0 +1,6 @@
+s = input()
+ans = 0
+for i in range(len(s)//2):
+    if s[i]!=s[-i-1]:
+        ans += 1
+print(ans)

ABC/ABC148/A.py

@@ -0,0 +1,4 @@
+a = int(input())
+b = int(input())
+
+print(6-a-b)

ABC/ABC148/B.py

@@ -0,0 +1,6 @@
+n = int(input())
+s, t = input().split()
+
+for i in range(n):
+    print(s[i]+t[i], end='')
+print('')

ABC/ABC148/C.py

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

ABC/ABC148/D.py

@@ -0,0 +1,11 @@
+n = int(input())
+a = list(map(int, input().split()))
+c = 1
+for j in a:
+    if j==c:
+        c += 1
+
+if c==1:
+    print(-1)
+else:
+    print(n-c+1)

README.md

@@ -104,10 +104,10 @@ AtCoderの問題をpython3で解いたものになります。AC確認は行っ
 |[ABC142](ABC/ABC142)|[✓](ABC/ABC142/A.py)|[✓](ABC/ABC142/B.py)|[✓](ABC/ABC142/C.py)||||
 |[ABC143](ABC/ABC143)|[✓](ABC/ABC143/A.py)|[✓](ABC/ABC143/B.py)|[✓](ABC/ABC143/C.py)|[✓](ABC/ABC143/D.py)|||
 |[ABC144](ABC/ABC144)|[✓](ABC/ABC144/A.py)|[✓](ABC/ABC144/B.py)|[✓](ABC/ABC144/C.py)|[✓](ABC/ABC144/D.py)|||
-|ABC145|||||||
-|ABC146|||||||
-|ABC147|||||||
-|ABC148|||||||
+|[ABC145](ABC/ABC145)|[✓](ABC/ABC145/A.py)|[✓](ABC/ABC145/B.py)|[✓](ABC/ABC145/C.py)||||
+|[ABC146](ABC/ABC146)|[✓](ABC/ABC146/A.py)|[✓](ABC/ABC146/B.py)|[✓](ABC/ABC146/C.py)||||
+|[ABC147](ABC/ABC147)|[✓](ABC/ABC147/A.py)|[✓](ABC/ABC147/B.py)|||||
+|[ABC148](ABC/ABC148)|[✓](ABC/ABC148/A.py)|[✓](ABC/ABC148/B.py)|[✓](ABC/ABC148/C.py)|[✓](ABC/ABC148/D.py)|||
 |ABC149|||||||
 |ABC150|||||||
 |ABC151|||||||