Merge pull request #625 from baekhangyeol/main

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

Author: github-actions[bot]

live9/test91/문제1/백한결.py

@@ -0,0 +1,29 @@
+def main():
+    N = int(input())
+    A = list(map(int, input().strip().split()))[:N]
+
+    A.sort()
+
+    left = 0
+    right = N-1
+
+    min_pair = (A[left], A[right])
+    min_num = float('inf')
+
+    while left < right:
+        sum = A[left] + A[right]
+
+        if abs(sum) < abs(min_num):
+            min_num = sum
+            min_pair = (A[left], A[right])
+
+        elif sum < 0:
+            left += 1
+        else:
+            right -= 1
+
+    print(min_pair[0], min_pair[1])
+
+
+if __name__ == '__main__':
+    main()

live9/test91/문제2/백한결.py

@@ -0,0 +1,26 @@
+from itertools import *
+
+def main():
+    N = int(input())
+    A = list(map(int, input().strip().split()))[:N]
+
+    all_p = list(permutations(A))
+
+    sum = 0
+
+    max_sum = 0
+
+    for p in range(len(all_p)):
+        for i in range(len(all_p[p])-1):
+            sum += abs(all_p[p][i] - all_p[p][i+1])
+
+        if sum > max_sum:
+            max_sum = sum
+
+        sum = 0
+
+    print(max_sum)
+
+
+if __name__ == '__main__':
+    main()

live9/test91/문제3/백한결.py

@@ -0,0 +1,27 @@
+def solution(answers):
+    drop_math1 = [1, 2, 3, 4, 5]
+    drop_math2 = [2, 1, 2, 3, 2, 4, 2, 5]
+    drop_math3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
+
+    result1, result2, result3 = 0, 0, 0
+
+    answer = []
+
+    for i in range(len(answers)):
+        if drop_math1[i % len(drop_math1)] == answers[i]:
+            result1 += 1
+        if drop_math2[i % len(drop_math2)] == answers[i]:
+            result2 += 1
+        if drop_math3[i % len(drop_math3)] == answers[i]:
+            result3 += 1
+
+    max_score = max(result1, result2, result3)
+
+    if result1 == max_score:
+        answer.append(1)
+    if result2 == max_score:
+        answer.append(2)
+    if result3 == max_score:
+        answer.append(3)
+
+    return answer