Merge remote-tracking branch 'upstream/main'

Author: eric-hjh

live8/test83/문제1/박희경.py

@@ -0,0 +1,32 @@
+import sys
+
+input = sys.stdin.readline
+
+
+def is_prime(num):
+    if num == 1:
+        return False
+    for i in range(2, int(num ** 0.5) + 1):
+        if num % i == 0:
+            return False
+    return True
+
+t = int(input())
+for _ in range(t):
+    k = int(input())
+    if is_prime(k):
+        print(0)
+    else:
+        plus, minus = k, k
+        cnt = 0
+        while True:
+            if is_prime(plus):
+                break
+            plus += 1
+            cnt += 1
+        while True:
+            if is_prime(minus):
+                break
+            minus -= 1
+            cnt += 1
+        print(cnt)

live8/test83/문제2/박희경.py

@@ -0,0 +1,29 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+cards = list(map(int, input().split()))
+m = int(input())
+arr = list(map(int, input().split()))
+
+cards.sort()  # [-10, 2, 3, 6, 10]
+
+
+def binary_search(start, end, target):
+    while start <= end:
+        mid = (start + end) // 2
+        if cards[mid] == target:
+            return True
+        elif cards[mid] > target:
+            end = mid - 1
+        else:
+            start = mid + 1
+
+
+for i in range(len(arr)):
+    if binary_search(0, n - 1, arr[i]):
+        arr[i] = 1
+    else:
+        arr[i] = 0
+print(*arr)

live8/test83/문제3/박희경.py

@@ -0,0 +1,11 @@
+def solution(lands):
+    dp = lands[0]
+
+    for i in range(1, len(lands)):
+        new_dp = [0] * 4
+        for j in range(4):
+            # 같은 열이 아닌 요소 중 가장 큰 값과 현재 값과 더하기 (누적해서)
+            new_dp[j] = lands[i][j] + max(dp[k] for k in range(4) if k != j)
+        dp = new_dp
+
+    return max(dp)