Merge pull request #707 from jinoo0306/main

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

Author: github-actions[bot]

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

@@ -0,0 +1,34 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .toString()
+  .trim()
+  .split("\n");
+
+function solution(input) {
+  const [N, M] = input[0].split(" ").map(Number);
+  const an = input[1].split(" ").map(Number);
+
+  const count = Array(M).fill(0);
+  let sum = 0;
+  let result = 0;
+
+  count[0] = 1;
+
+  for (let i = 0; i < N; i++) {
+    sum = (sum + an[i]) % M;
+
+    if (sum < 0) sum += M;
+
+    result += count[sum];
+    count[sum]++;
+  }
+
+  return result;
+}
+
+console.log(solution(input));

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

@@ -0,0 +1,49 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .trim()
+  .split("\n");
+
+function lowerBound(arr, target) {
+  let left = 0,
+    right = arr.length;
+  while (left < right) {
+    const mid = Math.floor((left + right) / 2);
+    if (arr[mid] >= target) right = mid;
+    else left = mid + 1;
+  }
+  return left;
+}
+
+function upperBound(arr, target) {
+  let left = 0,
+    right = arr.length;
+  while (left < right) {
+    const mid = Math.floor((left + right) / 2);
+    if (arr[mid] > target) right = mid;
+    else left = mid + 1;
+  }
+  return left;
+}
+
+function solution(input) {
+  const dots = input[1]
+    .split(" ")
+    .map(Number)
+    .sort((a, b) => a - b);
+  const lines = input.slice(2).map((line) => line.split(" ").map(Number));
+  const result = [];
+
+  for (let [a, b] of lines) {
+    const count = upperBound(dots, b) - lowerBound(dots, a);
+    result.push(count);
+  }
+
+  return result.join("\n");
+}
+
+console.log(solution(input));