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

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
    let n;
    while ((line = await readline())) {
        n = +line;
    }
    function isSS(x) {
        for (let i = 2; i <= x ** 0.5; i++) {
            if (x % i == 0) {
                return false;
                break;
            }
        }
        return true;
    }
    let [a, b] = [0, 0];
    let dis = 9999999999999;
    for (let i = 2; i <= n / 2; i++) {
        if (isSS(i) && isSS(n - i)) {
            if (Math.abs(n - i - i) < dis) {
                [a, b] = [i, n - i];
                dis = Math.abs(n - i - i);
            }
        }
    }
    console.log(a);
    console.log(b);
})();