题解 | #素数回文#
素数回文
http://www.nowcoder.com/practice/d638855898fb4d22bc0ae9314fed956f
function check(num) {
if (num < 2) return false;
for (let i = 2; i <= num / i; i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
let i = readline();
let reverse = i.split("").reverse().join("");
let newWord = i + "" + reverse.slice(1);
if (check(Number(newWord))) {
console.info("prime");
} else {
console.info("noprime");
}