Merge pull request #663 from eric-hjh/main

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

Author: github-actions[bot]

live9/test99/문제1/황장현.js

@@ -0,0 +1,76 @@
+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 N = input[0][0];
+  const An = input[1];
+  const 연산자수 = input[2];
+
+  let maxResult = -Infinity;
+  let minResult = Infinity;
+
+  function dfs(currentIndex, total, plus, minus, multiply, divide) {
+    if (currentIndex === An.length) {
+      maxResult = Math.max(maxResult, total);
+      minResult = Math.min(minResult, total);
+      return;
+    }
+
+    const currentNum = An[currentIndex];
+
+    if (plus > 0) {
+      dfs(
+        currentIndex + 1,
+        total + currentNum,
+        plus - 1,
+        minus,
+        multiply,
+        divide
+      );
+    }
+
+    if (minus > 0) {
+      dfs(
+        currentIndex + 1,
+        total - currentNum,
+        plus,
+        minus - 1,
+        multiply,
+        divide
+      );
+    }
+
+    if (multiply > 0) {
+      dfs(
+        currentIndex + 1,
+        total * currentNum,
+        plus,
+        minus,
+        multiply - 1,
+        divide
+      );
+    }
+
+    if (divide > 0) {
+      const result =
+        total < 0
+          ? -Math.floor(Math.abs(total) / currentNum)
+          : Math.floor(total / currentNum);
+
+      dfs(currentIndex + 1, result, plus, minus, multiply, divide - 1);
+    }
+  }
+
+  dfs(1, An[0], ...연산자수);
+  const result = [];
+  result.push(maxResult);
+  result.push(minResult);
+
+  return result.join('\n');
+}
+
+console.log(solution(input));

live9/test99/문제2/황장현.js

@@ -0,0 +1,38 @@
+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 [N, M] = input[0];
+  const number = input[1].sort((a, b) => a - b);
+
+  const visited = Array(N).fill(false);
+  const path = [];
+  const result = [];
+
+  function dfs(depth) {
+    if (depth === M) {
+      result.push(path.join(' '));
+      return;
+    }
+
+    for (let i = 0; i < N; i++) {
+      if (!visited[i]) {
+        visited[i] = true;
+        path.push(number[i]);
+        dfs(depth + 1);
+        path.pop();
+        visited[i] = false;
+      }
+    }
+  }
+
+  dfs(0);
+
+  return result.join('\n');
+}
+
+console.log(solution(input));

live9/test99/문제3/황장현.js

@@ -0,0 +1,28 @@
+function solution(s) {
+  const obj = {
+    '}': '{',
+    ']': '[',
+    ')': '(',
+  };
+
+  const isCorrect = (string) => {
+    const stack = [];
+    for (const char of string) {
+      if ('{[('.includes(char)) stack.push(char);
+      else if (obj[char] !== stack.pop()) return false;
+    }
+    return stack.length ? false : true;
+  };
+
+  const rotate = (string) => string.substringing(1) + string[0];
+
+  let result = 0;
+  for (let i = 0; i < s.length; i++) {
+    s = rotate(s);
+
+    result += isCorrect(s) ? 1 : 0;
+  }
+  return result;
+}
+
+console.log(solution('[](){}'));