Merge pull request #568 from eric-hjh/main

[황장헌] 75차 라이브 코테 제출

Author: github-actions[bot]

live7/test74/문제3/황장현.js

@@ -0,0 +1,13 @@
+function solution(n, left, right) {
+  const result = [];
+
+  for (let index = left; index <= right; index++) {
+    const row = Math.floor(index / n);
+    const col = index % n;
+    result.push(Math.max(row + 1, col + 1));
+  }
+
+  return result;
+}
+
+console.log(solution(3, 2, 5));

live7/test75/문제1/황장현.js

@@ -0,0 +1,42 @@
+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 map = input.slice(1);
+  let count = 0;
+
+  function 재귀(sum, prevPlace, day) {
+    if (day === N) {
+      if (sum >= M) count++;
+      return;
+    }
+
+    for (let i = 0; i < 2; i++) {
+      for (let j = 0; j < 3; j++) {
+        let temp = sum;
+        if (j === prevPlace) {
+          temp += map[i][j] / 2;
+        } else {
+          temp += map[i][j];
+        }
+        재귀(temp, j, day + 1);
+      }
+    }
+  }
+
+  for (let i = 0; i < 2; i++) {
+    for (let j = 0; j < 3; j++) {
+      const sum = map[i][j];
+      재귀(sum, j, 1);
+    }
+  }
+
+  return count;
+}
+
+console.log(solution(input));

live7/test75/문제2/황장현.js

@@ -0,0 +1,26 @@
+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];
+  let 최솟값 = Infinity;
+  const map = input.slice(1);
+
+  function 재귀(index, 신맛, 쓴맛, used) {
+    if (used > 0) 최솟값 = Math.min(최솟값, Math.abs(신맛 - 쓴맛));
+
+    if (index === N) return;
+
+    재귀(index + 1, 신맛 * map[index][0], 쓴맛 + map[index][1], used + 1);
+    재귀(index + 1, 신맛, 쓴맛, used);
+  }
+
+  재귀(0, 1, 0, 0);
+  console.log(최솟값);
+}
+
+console.log(solution(input));

live7/test75/문제3/황장현.js

@@ -0,0 +1,24 @@
+function solution(s) {
+  const temp = s
+    .slice(2, -2)
+    .split('},{')
+    .map((s) => s.split(',').map(Number));
+
+  temp.sort((a, b) => a.length - b.length);
+
+  const result = [];
+  const seen = new Set();
+
+  for (const arr of temp) {
+    for (const num of arr) {
+      if (!seen.has(num)) {
+        result.push(num);
+        seen.add(num);
+      }
+    }
+  }
+
+  return result;
+}
+
+console.log(solution('{{2},{2,1},{2,1,3},{2,1,3,4}}'));