Merge pull request #673 from gmlrude/main

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

Author: github-actions[bot]

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

@@ -0,0 +1,28 @@
+"""
+dp[1] = 1
+dp[2] = 2 (1+1, 2)
+dp[3] = 4 (1+1+1, 1+2(*2), 3)
+dp[4] = 7
+dp[5] = 13
+dp[6] = 24
+dp[7] = 44
+dp[n] = dp[n-1] + dp[n-2] + dp[n-3]
+"""
+import sys
+
+input = sys.stdin.readline
+
+
+dp = [0] * 11
+dp[1] = 1
+dp[2] = 2
+dp[3] = 4
+
+for i in range(4, 11):
+    dp[i] = dp[i-1] + dp[i-2] + dp[i-3]
+
+t = int(input())
+for _ in range(t):
+    n = int(input())
+    print(dp[n])
+

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

@@ -0,0 +1,18 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+color = [list(map(int, input().split())) for _ in range(n)]
+
+for i in range(n-1):
+    min_cost = min(color[i])
+    min_idx = color[i].index(min_cost)
+    for j in range(3):
+        if j != min_idx:
+            color[i+1][j] += min_cost
+        else:
+            color[i][min_idx] = float('inf')
+            color[i+1][j] += min(color[i])
+
+print(min(color[-1]))

live10/test101/문제3/박희경.py

@@ -0,0 +1,24 @@
+from collections import * 
+
+def solution(n, edge):
+    
+    graph = [[] for _ in range(n + 1)]
+    
+    for a, b in edge:
+        graph[a].append(b)
+        graph[b].append(a)
+    
+    visited = [0] * (n + 1)
+    visited[1] = 1
+
+    def bfs(x):
+        q = deque([x])
+        while q:
+            x = q.popleft()
+            for nei in graph[x]:
+                if not visited[nei]: 
+                    visited[nei] = visited[x] + 1
+                    q.append(nei)
+    bfs(1)
+
+    return visited.count(max(visited))