Merge pull request #675 from jinoo0306/main

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

Author: github-actions[bot]

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

@@ -0,0 +1,30 @@
+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 = input;
+
+  const an = [];
+  an[0] = 0;
+  an[1] = 1;
+  // an[2] = 3;
+  // an[3] = 5;
+  // an[4] = 11;
+  // an[5] = 21;
+  // an[6] = 43;
+  for (let i = 2; i <= N; i++) {
+    an[i] = (an[i - 1] * 2 + (i % 2 === 1 ? -1 : 1)) % 10007;
+    // console.log(`A(${i}) = ${an[i]}`);
+  }
+
+  return an[N];
+}
+
+console.log(solution(input));

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

@@ -0,0 +1,30 @@
+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((line) => line.split(" ").map(Number));
+
+function solution(input) {
+  const N = input[0];
+  const stocks = [...input[1]];
+  let max = 0;
+  let dp = stocks[0]; // 주식의 최소값을 기억
+
+  for (let i = 1; i < N; i++) {
+    if (stocks[i] - dp > 0) max = Math.max(max, stocks[i] - dp);
+    if (stocks[i] < dp) dp = stocks[i];
+  }
+
+  return max;
+}
+
+console.log(solution(input));

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

@@ -0,0 +1,23 @@
+function solution(x, y, n) {
+  const visited = new Set([x]);
+  const queue = [[x, 0]];
+  let queueIndex = 0;
+
+  while (queueIndex < queue.length) {
+    const [current, count] = queue[queueIndex++];
+    if (current === y) return count;
+
+    const calculate = [current + n, current * 2, current * 3];
+
+    for (const cal of calculate) {
+      if (cal <= y && !visited.has(cal)) {
+        visited.add(cal);
+        queue.push([cal, count + 1]);
+      }
+    }
+  }
+
+  return -1;
+}
+
+console.log(solution(10, 40, 30));