✏️ 문제(4673 / 셀프넘버 / node.js)
📝 해답
const arr = [];
const numberArr = [];
for (let i = 1; i < 10001; i++) {
numberArr.push(i);
}
for (let i = 1; i < 10001; i++) {
let n = 0;
let stringToNumber = String(i);
for (let j = 0; j < stringToNumber.length; j++) {
n += Number(stringToNumber[j]);
}
let constructor = i + n;
arr.push(constructor);
}
const subtraction = numberArr.filter((x) => !arr.includes(x));
console.log(subtraction.join('\n'));
✏️ 문제(1065 / 한수 / node.js)
📝 해답
const fs = require('fs');
const input = fs.readFileSync('/dev/stdin');
const N = Number(input);
function solution(N) {
let hansoo = 0;
for (let i = 1; i <= N; i++) {
if (i < 100) hansoo++;
else {
const arr = String(i).split('').map(Number);
if (arr[0] - arr[1] === arr[1] - arr[2]) hansoo++;
}
}
console.log(hansoo);
}
solution(N);
댓글