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

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 num1 = 0
        let num2 = 0
        for (let i = Math.floor(line / 2); i >= 1 ; i--) {
            if (isPrime(i) && isPrime(line - i)) {
                num1 = i 
                num2 = line - i
                break
            }
        }
        console.log(num1)
        console.log(num2)

        // 判断是不是素数
        function isPrime(n) {
            if (n == 1) return false
            if (n == 2) return true
            for (let i = 2; i <= Math.sqrt(n); i++) {
                if (n % i == 0) return false
            }
            return true
        }

    }
}()