Merge remote-tracking branch 'upstream/main'

Author: Eric

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/문제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/문제1/조진우.js

@@ -0,0 +1,36 @@
+const fs = require("fs");
+const path = require("path");
+
+const filePath =
+  process.platform === "linux"
+    ? "/dev/stdin"
+    : path.join(__dirname, "input.txt");
+
+const input = fs
+  .readFileSync(filePath, "utf8")
+  .toString()
+  .trim()
+  .split("\n")
+  .map(Number);
+
+function solution(input) {
+  const T = input[0];
+  const arr = input.slice(1);
+  const result = [];
+
+  function dfs(sum, target) {
+    if (sum === target) return 1;
+    if (sum > target) return 0;
+
+    return dfs(sum + 1, target) + dfs(sum + 2, target) + dfs(sum + 3, target);
+  }
+
+  for (let i = 0; i < T; i++) {
+    const n = arr[i];
+    result.push(dfs(0, n));
+  }
+
+  return result;
+}
+
+console.log(solution(input).join("\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/문제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/문제2/조진우.js

@@ -0,0 +1,34 @@
+const fs = require("fs");
+const path = require("path");
+
+const filePath =
+  process.platform === "linux"
+    ? "/dev/stdin"
+    : path.join(__dirname, "input.txt");
+
+const input = fs
+  .readFileSync(filePath, "utf8")
+  .toString()
+  .trim()
+  .split("\n")
+  .map((value) => value.split(" ").map(Number));
+
+function solution(input) {
+  const N = input[0][0];
+  const costs = input.slice(1);
+  const dp = [...costs[0]];
+
+  for (let i = 1; i < N; i++) {
+    const temp = [0, 0, 0];
+    for (let j = 0; j < 3; j++) {
+      if (j === 0) temp[0] = costs[i][0] + Math.min(dp[1], dp[2]);
+      else if (j === 1) temp[1] = costs[i][1] + Math.min(dp[0], dp[2]);
+      else if (j === 2) temp[2] = costs[i][2] + Math.min(dp[0], dp[1]);
+    }
+    dp.splice(0, 3, ...temp);
+  }
+
+  return Math.min(...dp);
+}
+
+console.log(solution(input));

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))

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)

live10/test101/문제3/조진우.js

@@ -0,0 +1,55 @@
+function solution(n, edge) {
+  const map = Array(n + 1)
+    .fill()
+    .map(() => []);
+  for (let i = 0; i < edge.length; i++) {
+    let a = edge[i][0];
+    let b = edge[i][1];
+    map[a].push(b);
+    map[b].push(a);
+  }
+
+  const visited = Array(n + 1).fill(0);
+  const q = [];
+  q.push(1);
+  visited[1] = 1;
+
+  while (q.length > 0) {
+    const now = q.shift();
+    for (let i = 0; i < map[now].length; i++) {
+      let next = map[now][i];
+      if (visited[next] === 0) {
+        visited[next] = visited[now] + 1;
+        q.push(next);
+      }
+    }
+  }
+
+  let max = 0;
+  for (let i = 0; i < visited.length; i++) {
+    if (visited[i] > max) {
+      max = visited[i];
+    }
+  }
+
+  let answer = 0;
+  for (let i = 0; i < visited.length; i++) {
+    if (visited[i] === max) {
+      answer++;
+    }
+  }
+
+  return answer;
+}
+
+console.log(
+  solution([
+    [3, 6],
+    [4, 3],
+    [3, 2],
+    [1, 3],
+    [1, 2],
+    [2, 4],
+    [5, 2],
+  ])
+);