add ABC143

Author: IsHYuhi

ABC/ABC143/D.py

@@ -0,0 +1,13 @@
+import bisect
+
+n = int(input())
+l = list(map(int, input().split()))
+
+l.sort()
+ans = 0
+for i in range(n-1):
+    b = l[:i]
+    c = l[i+1:]
+    for j in b:
+        ans += bisect.bisect_left(c, l[i] + j)#2番目の棒より短く(left), 一定以上の長さを持つ([i+1:])
+print(ans)

ABC/ABC144/A.py

@@ -0,0 +1,6 @@
+a, b = map(int, input().split())
+
+if 1<=a<=9 and 1<=b<=9:
+    print(a*b)
+else:
+    print(-1)

ABC/ABC144/B.py

@@ -0,0 +1,24 @@
+n = int(input())
+
+def binary_search(l, target):
+    left = 0
+    right = len(l)
+    while left<right:
+        mid = (left+right)//2
+
+        if target == l[mid]:
+            return True
+        elif target < l[mid]:
+            right = mid
+        else:
+            left = mid+1
+
+    return False
+
+seki = [i*j for i in range(1, 10) for j in range(1, 10)]
+seki.sort()
+
+if binary_search(seki, n):
+    print('Yes')
+else:
+    print('No')

ABC/ABC144/C.py

@@ -0,0 +1,7 @@
+import math
+n = int(input())
+ans = float('inf')
+for i in range(1, int(math.sqrt(n)+1)):
+    if n%i==0:
+        ans = min(i + n//i - 2, ans)
+print(ans)