Node.js 백준 알고리즘 4

1. 10871 X 보다 작은 수

let fs = require("fs");
let input = fs.readFileSync("/dev/stdin").toString().split("\n");

const line1 = input[0].split(" ");
const N = Number(line1[0]);
const X = Number(line1[1]);
const numbers = input[1].split(" ");
const result = [];
let i = 0;

for (i; i < N; i++) {
    if (numbers[i] < X) {
        result.push(numbers[i]);
    }
}

console.log(result.join(" "));

2. 10952 A+B-5

const readline = require("readline");

const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout,
});

let input = [];

rl.on("line", function (line) {
    input.push(line);
}).on("close", function () {
    let i = 0,
        result = "";
    const numbers = input.map(function (line) {
        return line.split(" ");
    });

    while (numbers[i][0] !== "0" || numbers[i][1] !== "0") {
        // 2번째 행 부터 개행 문자를 넣어준다
        if (i !== 0) {
            result += "\n";
        }

        const sum = numbers[i].reduce(function (acc, cur) {
            return Number(acc) + Number(cur);
        }, 0);

        result += `${sum}`;
        i++;
    }

    console.log(result);
    process.exit();
});