Merge pull request #671 from jinoo0306/main

 [조진우] 101차 라이브 코테 제출

Author: github-actions[bot]

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/조진우.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/조진우.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],
+  ])
+);