Merge pull request #670 from baekhangyeol/main

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

Author: github-actions[bot]

live10/test101/문제1/백한결.py

@@ -0,0 +1,26 @@
+dp = [-1] * 11
+
+def main():
+    T = int(input())
+
+    for i in range(T):
+        n = int(input())
+
+        print(recursion(n))
+
+
+def recursion(n):
+    if n == 0:
+        return 1
+    if n < 0:
+        return 0
+
+    if dp[n] != -1:
+        return dp[n]
+
+    dp[n] = recursion(n-1) + recursion(n-2) + recursion(n-3)
+
+    return dp[n]
+
+if __name__ == "__main__":
+    main()

live10/test101/문제2/백한결.py

@@ -0,0 +1,20 @@
+def main():
+    N = int(input())
+    cost = [list(map(int, input().split())) for _ in range(N)]
+
+    dp = [[0] * 3 for _ in range(N)]
+
+    dp[0][0] = cost[0][0]
+    dp[0][1] = cost[0][1]
+    dp[0][2] = cost[0][2]
+
+    for i in range(1, N):
+        dp[i][0] = min(dp[i-1][1], dp[i-1][2]) + cost[i][0]
+        dp[i][1] = min(dp[i-1][0], dp[i-1][2]) + cost[i][1]
+        dp[i][2] = min(dp[i-1][0], dp[i-1][1]) + cost[i][2]
+
+    print(min(dp[N-1]))
+
+
+if __name__ == "__main__":
+    main()

live10/test101/문제3/백한결.py

@@ -0,0 +1,24 @@
+from collections import deque
+
+def solution(n, edge):
+    graph = [[] for _ in range(n + 1)]
+
+    for a, b in edge:
+        graph[a].append(b)
+        graph[b].append(a)
+
+    distance = [-1] * (n + 1)
+    distance[1] = 0
+
+    queue = deque([1])
+
+    while queue:
+        now = queue.popleft()
+        for neighbor in graph[now]:
+            if distance[neighbor] == -1:
+                distance[neighbor] = distance[now] + 1
+                queue.append(neighbor)
+
+    max_distance = max(distance)
+
+    return distance.count(max_distance)