Merge pull request #708 from gmlrude/main

[박희경] 109차 라이브 코테 제출

Author: github-actions[bot]

live10/test109/문제1/박희경.py

@@ -0,0 +1,25 @@
+import sys
+
+input = sys.stdin.readline
+
+n, m = map(int, input().split())
+a = list(map(int, input().split()))
+
+remain = [0] * m    # 나머지 개수 
+prefix_sum = 0
+for i in range(n):
+    prefix_sum += a[i]
+    remain[prefix_sum % m] += 1
+
+res = remain[0]
+# 나머지가 같은 구간 2개를 뽑으면 나머지가 0이 됨
+for r in remain:
+    # 조합; rC2 = r(r-1) / 2
+    res += r * (r - 1) // 2
+
+print(res)
+
+"""
+5 3
+1 2 3 1 2
+"""

live10/test109/문제2/박희경.py

@@ -0,0 +1,46 @@
+import sys
+
+input = sys.stdin.readline
+
+n, m = map(int, input().split())
+dots = sorted(list(map(int, input().split())))
+
+# 타겟을 찾는 최초 좌표 구하기
+def lower_bound(arr, target):
+    start, end = 0, len(arr)
+    while start < end:
+        mid = (start + end) // 2
+        if arr[mid] < target:
+            start = mid + 1
+        else:
+            end = mid
+    return start
+
+# 타겟을 포함한 좌표 구하기 (놓친 부분 : 나눠서 해야 하는구나)
+def upper_bound(arr, target):
+    start, end = 0, len(arr)
+    while start < end:
+        mid = (start + end) // 2
+        if arr[mid] <= target:
+            start = mid + 1
+        else:
+            end = mid
+    return start
+
+
+for _ in range(m):
+    a, b = map(int, input().split())
+
+    left = lower_bound(dots, a) 
+    right = upper_bound(dots, b)
+    print(right - left)
+
+"""
+5 5
+1 3 10 20 30
+1 10
+20 60
+3 30
+2 15
+4 8
+"""