Merge pull request #688 from eric-hjh/main

[황장현] 104차 라이브 코테 제출

Author: github-actions[bot]

live10/test104/문제1/황장현.js

@@ -0,0 +1,26 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n')
+  .map((el) => el.split(' ').map(Number));
+
+function solution(input) {
+  const T = input[0][0];
+  const nums = input.slice(1);
+  const dp = Array(101).fill(0);
+
+  dp[1] = 1;
+  dp[2] = 1;
+  dp[3] = 1;
+  dp[4] = 2;
+  dp[5] = 2;
+
+  for (let i = 6; i <= 100; i++) {
+    dp[i] = dp[i - 1] + dp[i - 5];
+  }
+
+  return nums.map((n) => dp[n]).join('\n');
+}
+
+console.log(solution(input));

live10/test104/문제2/황장현.js

@@ -0,0 +1,36 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n');
+
+function solution(input) {
+  const N = Number(input[0]);
+  const relations = input.slice(1).map((line) => line.split(''));
+
+  let max = 0;
+
+  for (let i = 0; i < N; i++) {
+    const set = new Set();
+
+    for (let j = 0; j < N; j++) {
+      if (i === j) continue;
+
+      if (relations[i][j] === 'Y') {
+        set.add(j);
+      } else {
+        for (let k = 0; k < N; k++) {
+          if (relations[i][k] === 'Y' && relations[k][j] === 'Y') {
+            set.add(j);
+            break;
+          }
+        }
+      }
+    }
+
+    max = Math.max(max, set.size);
+  }
+  return max;
+}
+
+console.log(solution(input));

live10/test104/문제3/황장현.js

@@ -0,0 +1,34 @@
+function solution(begin, target, words) {
+  if (!words.includes(target)) return 0;
+
+  const queue = [[begin, 0]];
+  const visited = new Set();
+
+  function canTransform(word1, word2) {
+    let diffCount = 0;
+
+    for (let i = 0; i < word1.length; i++) {
+      if (word1[i] !== word2[i]) diffCount++;
+      if (diffCount > 1) return false;
+    }
+
+    return diffCount === 1;
+  }
+
+  while (queue.length) {
+    const [current, count] = queue.shift();
+
+    if (current === target) return count;
+
+    for (const word of words) {
+      if (!visited.has(word) && canTransform(current, word)) {
+        visited.add(word);
+        queue.push([word, count + 1]);
+      }
+    }
+  }
+
+  return 0;
+}
+
+console.log(solution('hit', 'cog', ['hot', 'lot', 'dog', 'dot', 'log', 'cog']));