Merge pull request #660 from jinoo0306/main

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

Author: github-actions[bot]

.gitignore

@@ -2,4 +2,5 @@
 .DS_Store
 /out
 out
-*.iml
+*.iml
+**/input.txt

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

@@ -0,0 +1,47 @@
+const fs = require("fs");
+const input = fs
+  // .readFileSync("./input.txt", "utf8")
+  .readFileSync("/dev/stdin", "utf8")
+  .toString()
+  .trim()
+  .split("\n")
+  .map((line) => line.trim().split(" ").map(Number));
+
+function solution(input) {
+  const t = input[0][0];
+  const arr = input[1];
+
+  let max = -Infinity;
+  let min = Infinity;
+
+  const dfs = (index, value, [plus, minus, multiply, divide]) => {
+    if (index === t) {
+      max = Math.max(max, value);
+      min = Math.min(min, value);
+      return;
+    }
+
+    if (plus > 0)
+      dfs(index + 1, value + arr[index], [plus - 1, minus, multiply, divide]);
+
+    if (minus > 0)
+      dfs(index + 1, value - arr[index], [plus, minus - 1, multiply, divide]);
+
+    if (multiply > 0)
+      dfs(index + 1, value * arr[index], [plus, minus, multiply - 1, divide]);
+
+    if (divide > 0) {
+      const result =
+        value < 0
+          ? -Math.floor(-value / arr[index])
+          : Math.floor(value / arr[index]);
+      dfs(index + 1, result, [plus, minus, multiply, divide - 1]);
+    }
+  };
+
+  dfs(1, arr[0], input[2]); // (index, value, [plux, minus, multiply, divide])
+
+  return `${max}\n${min}`;
+}
+
+console.log(solution(input));

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

@@ -0,0 +1,38 @@
+const fs = require("fs");
+const input = fs
+  // .readFileSync("./input.txt", "utf8")
+  .readFileSync("/dev/stdin", "utf8")
+  .toString()
+  .trim()
+  .split("\n")
+  .map((line) => line.trim().split(" ").map(Number));
+
+function solution(input) {
+  const [N, M] = input[0];
+  const arr = input[1];
+  arr.sort((a, b) => a - b);
+
+  const used = Array(N).fill(false);
+  const result = [];
+
+  function dfs(depth) {
+    if (depth === M) {
+      console.log(result.join(" "));
+      return;
+    }
+
+    for (let i = 0; i < N; i++) {
+      if (used[i]) continue;
+
+      used[i] = true;
+      result.push(arr[i]);
+      dfs(depth + 1);
+      result.pop();
+      used[i] = false;
+    }
+  }
+
+  dfs(0);
+}
+
+solution(input);

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

@@ -0,0 +1,30 @@
+function solution(s) {
+  const isValid = (str) => {
+    const stack = [];
+    const pairs = {
+      ")": "(",
+      "]": "[",
+      "}": "{",
+    };
+
+    for (const char of str) {
+      if (char === "(" || char === "[" || char === "{") {
+        stack.push(char);
+      } else {
+        if (stack.pop() !== pairs[char]) return false;
+      }
+    }
+
+    return stack.length === 0;
+  };
+
+  let count = 0;
+  for (let i = 0; i < s.length; i++) {
+    const rotated = s.slice(i) + s.slice(0, i);
+    if (isValid(rotated)) count++;
+  }
+
+  return count;
+}
+
+console.log(solution("[](){}"));