题解 | #查找组成一个偶数最接近的两个素数#

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void (async function () {
    // 验证素数
    function isPrime(num) {
        if (num <= 1) return false; // 1和负数不是素数
        for (let i = 2; i <= Math.sqrt(num); i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
    let input = await readline();
    input = parseInt(input)
    let res1 = -1;
    let res2 = -1;
    for (let i = 1; i <= input / 2; i++) {
        if (isPrime(i) && isPrime(input - i)) {
            res1 = i;
            res2 = input - i;
        }
    }
    console.log(res1);
    console.log(res2)


    // Write your code here
    // while(line = await readline()){
    //     let tokens = line.split(' ');
    //     let a = parseInt(tokens[0]);
    //     let b = parseInt(tokens[1]);
    //     console.log(a + b);
    // }
})();