Merge pull request #689 from jinoo0306/main

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

Author: github-actions[bot]

live10/test104/문제1/조진우.js

@@ -0,0 +1,36 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .toString()
+  .trim()
+  .split("\n")
+  .map(Number);
+
+function solution(input) {
+  const T = input[0];
+  const N = input.slice(1);
+  const dp = [];
+  const result = [];
+  dp[0] = 0;
+  dp[1] = 1;
+  dp[2] = 1;
+  dp[3] = 1;
+  dp[4] = 2;
+  dp[5] = 2;
+
+  for (let i = 6; i <= Math.max(...N); i++) {
+    dp[i] = dp[i - 1] + dp[i - 5];
+  }
+
+  for (let i = 0; i < T; i++) {
+    result[i] = dp[N[i]];
+  }
+
+  return result.join("\n");
+}
+
+console.log(solution(input));

live10/test104/문제2/조진우.js

@@ -0,0 +1,43 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .toString()
+  .trim()
+  .split("\n")
+  .map((line) => line.split(""));
+
+function solution(input) {
+  const N = Number(input[0].join(""));
+  const friends = input.slice(1);
+  let maxCount = 0;
+
+  for (let i = 0; i < N; i++) {
+    const visited = Array(N).fill(false);
+
+    for (let j = 0; j < N; j++) {
+      if (i === j) continue;
+
+      if (friends[i][j] === "Y") {
+        visited[j] = true;
+      } else {
+        for (let k = 0; k < N; k++) {
+          if (friends[i][k] === "Y" && friends[k][j] === "Y") {
+            visited[j] = true;
+            break;
+          }
+        }
+      }
+    }
+
+    const count = visited.filter(Boolean).length;
+    maxCount = Math.max(maxCount, count);
+  }
+
+  return maxCount;
+}
+
+console.log(solution(input));

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

@@ -0,0 +1,32 @@
+function solution(begin, target, words) {
+  let visit = [];
+  let box = [];
+  box.push([begin, 0]);
+
+  while (box.length > 0) {
+    let now = box.shift();
+    let txt = now[0];
+    let cnt = now[1];
+
+    if (txt === target) {
+      return cnt;
+    }
+
+    for (let i = 0; i < words.length; i++) {
+      let word = words[i];
+      let diff = 0;
+      for (let j = 0; j < word.length; j++) {
+        if (txt[j] !== word[j]) {
+          diff++;
+        }
+      }
+
+      if (diff === 1 && !visit.includes(word)) {
+        visit.push(word);
+        box.push([word, cnt + 1]);
+      }
+    }
+  }
+
+  return 0;
+}