Merge pull request #615 from baekhangyeol/main

[백한결] 89차 라이브 코테 제출

Author: github-actions[bot]

live8/test89/문제1/백한결.py

@@ -0,0 +1,29 @@
+def main():
+    min_count = float('inf')
+
+    N = int(input())
+
+    array = [int(input()) for _ in range(N)]
+
+    array.sort()
+
+    for i in range(len(array)):
+        for j in range(i, len(array)):
+            min_val = array[i]
+            max_val = array[j]
+
+            current_length = j - i + 1
+
+            required_length = max_val - min_val + 1
+
+            if required_length <= 5:
+                need_number = 5 - current_length
+            else:
+                need_number = float('inf')
+
+            min_count = min(min_count, need_number)
+    print(min_count)
+
+
+if __name__ == '__main__':
+    main()

live8/test89/문제2/백한결.py

@@ -0,0 +1,24 @@
+def main():
+    N, M = map(int, input().split())
+
+    A = list(map(int, input().strip().split()))[:N]
+
+    left = 0
+    sum = 0
+
+    count = 0
+
+    for right in range(N):
+        sum += A[right]
+
+        while sum >= M:
+            if sum == M:
+                count += 1
+            sum -= A[left]
+            left += 1
+
+    print(count)
+
+
+if __name__ == '__main__':
+    main()

live8/test89/문제3/백한결.py

@@ -0,0 +1,8 @@
+def solution(numbers):
+    str_array = list(map(str, numbers))
+
+    sorted_array = sorted(str_array, key=lambda x: x * 3, reverse=True)
+
+    answer = ''.join(sorted_array)
+
+    return '0' if answer[0] == '0' else answer