Merge pull request #617 from sangminlee98/main

[이상민] 89차 라이브 코테 제출

Author: github-actions[bot]

live8/test89/문제1/이상민.js

@@ -0,0 +1,23 @@
+const input = require("fs")
+  .readFileSync(process.platform === "linux" ? "/dev/stdin" : "./input.txt")
+  .toString()
+  .trim()
+  .split("\n");
+
+const N = Number(input[0]);
+const arr = input.map(Number).splice(1);
+
+arr.sort((a, b) => a - b);
+
+let min = Number.MAX_SAFE_INTEGER;
+
+for (let i = 0; i < N; i++) {
+  const set = new Set([arr[i] + 1, arr[i] + 2, arr[i] + 3, arr[i] + 4]);
+  let cnt = 0;
+  for (let j = 0; j < N; j++) {
+    if (set.has(arr[j])) cnt++;
+  }
+  min = Math.min(cnt, min);
+}
+
+console.log(min);

live8/test89/문제2/이상민.js

@@ -0,0 +1,22 @@
+const input = require("fs")
+  .readFileSync(process.platform === "linux" ? "/dev/stdin" : "./input.txt")
+  .toString()
+  .trim()
+  .split("\n");
+
+const [N, M] = input[0].split(" ").map(Number);
+const arr = input[1].split(" ").map(Number);
+
+let cnt = 0;
+
+for (let i = 0; i < N; i++) {
+  let sum = arr[i];
+  let idx = i;
+  while (sum < M && idx < N) {
+    idx++;
+    sum += arr[idx];
+  }
+  if (sum === M) cnt++;
+}
+
+console.log(cnt);

live8/test89/문제3/이상민.js

@@ -0,0 +1,6 @@
+function solution(numbers) {
+  const strNum = numbers.map(String);
+  if (strNum.every((str) => str === "0")) return "0";
+  strNum.sort((a, b) => b + a - (a + b));
+  return strNum.join("");
+}