Merge pull request #664 from jinoo0306/main

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

Author: github-actions[bot]

live9/test100/문제1/조진우.js

@@ -0,0 +1,31 @@
+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();
+
+function solution(input) {
+  const N = Number(input);
+  const romaNum = [1, 5, 10, 50];
+  const result = [];
+
+  function dfs(index, sum, start) {
+    if (index === N) {
+      result.push(sum);
+      return;
+    }
+
+    for (let i = start; i < romaNum.length; i++)
+      dfs(index + 1, sum + romaNum[i], i);
+  }
+
+  dfs(0, 0, 0);
+
+  return [...new Set(result)].length;
+}
+
+console.log(solution(input));

live9/test100/문제2/조진우.js

@@ -0,0 +1,43 @@
+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();
+
+function solution(input) {
+  const N = Number(input);
+  let answer = 0;
+
+  function check(array, row, col) {
+    for (let i = 0; i < row; i++) {
+      if (array[i] === col) return false;
+      if (Math.abs(i - row) === Math.abs(array[i] - col)) return false;
+    }
+    return true;
+  }
+
+  function dfs(row, array) {
+    if (row === N) {
+      answer++;
+      return;
+    }
+
+    for (let i = 0; i < N; i++) {
+      if (check(array, row, i)) {
+        array[row] = i;
+        dfs(row + 1, array);
+        array[row] = 0;
+      }
+    }
+  }
+
+  const arr = new Array(N).fill(0);
+  dfs(0, arr);
+  return answer;
+}
+
+console.log(solution(input));

live9/test100/문제3/조진우.js

@@ -0,0 +1,30 @@
+function solution(queue1, queue2) {
+  const totalLength = queue1.length + queue2.length;
+  const merged = [...queue1, ...queue2];
+
+  let sum1 = queue1.reduce((a, b) => a + b, 0);
+  let sum2 = queue2.reduce((a, b) => a + b, 0);
+  const target = (sum1 + sum2) / 2;
+
+  if ((sum1 + sum2) % 2 !== 0) return -1;
+
+  let p1 = 0;
+  let p2 = queue1.length;
+  let moveCount = 0;
+
+  while (moveCount <= totalLength * 3) {
+    if (sum1 === target) return moveCount;
+
+    if (sum1 > target) {
+      sum1 -= merged[p1];
+      p1++;
+    } else {
+      sum1 += merged[p2];
+      p2++;
+    }
+
+    moveCount++;
+  }
+
+  return -1;
+}