[백준 알고리즘] javascript 분해합 2231번

function calculateConstruct(value) {
  return [...value.toString()]
    .map((item) => parseInt(item))
    .reduce((acc, cur) => acc + cur, parseInt(value));
}

function main() {
  const filePath = process.platform === "linux" ? "/dev/stdin" : "ex.txt";
  const N = require("fs").readFileSync(filePath).toString().trim();

  let result = 0;
  for (let i = 0; i < N; i++) {
    const construct = calculateConstruct(i);
    if (construct === parseInt(N)) {
      result = i;
      break;
    }
  }
  console.log(result);
}

main();