题解 | #自守数#
自守数
https://www.nowcoder.com/practice/88ddd31618f04514ae3a689e83f3ab8e
const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;
void (async function () {
// Write your code here
while ((line = await readline())) {
let res = 0;
for (let i = 0; i <= line; i++) {
if (isZishoushu(i)) {
res++;
}
}
console.log(res);
}
})();
function isZishoushu(n) {
let pow = Math.pow(n, 2);
// console.log(pow);
let s = String(n);
// console.log(s);
if (pow % Math.pow(10, s.length) == n) return true;
return false;
}
SHEIN希音公司福利 222人发布