Merge pull request #720 from jinoo0306/main

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

Author: github-actions[bot]

live11/test113/문제1/조진우.js

@@ -0,0 +1,40 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .trim()
+  .split("\n");
+
+function solution(input) {
+  let index = 0;
+  const T = Number(input[index++]);
+  const output = [];
+
+  for (let t = 0; t < T; t++) {
+    const N = Number(input[index++]);
+    const numbers = [];
+
+    for (let i = 0; i < N; i++) {
+      numbers.push(input[index++]);
+    }
+
+    numbers.sort();
+
+    let consistent = true;
+    for (let i = 0; i < N - 1; i++) {
+      if (numbers[i + 1].startsWith(numbers[i])) {
+        consistent = false;
+        break;
+      }
+    }
+
+    output.push(consistent ? "YES" : "NO");
+  }
+
+  return output.join("\n");
+}
+
+console.log(solution(input));

live11/test113/문제2/조진우.js

@@ -0,0 +1,39 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .trim()
+  .split("\n");
+
+function solution(input) {
+  const N = Number(input[0]);
+  const root = {};
+
+  for (let i = 1; i <= N; i++) {
+    const arr = input[i].split(" ");
+    const path = arr.slice(1);
+
+    let current = root;
+    for (let food of path) {
+      if (!current[food]) {
+        current[food] = {};
+      }
+      current = current[food];
+    }
+  }
+
+  function dfs(node, depth) {
+    const keys = Object.keys(node).sort();
+    for (let key of keys) {
+      console.log("--".repeat(depth) + key);
+      dfs(node[key], depth + 1);
+    }
+  }
+
+  dfs(root, 0);
+}
+
+solution(input);