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

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int n = sc.nextInt();
            int min = 0;
            int max = 0;
            int value = -1;
            for (int i = 2; i <= n / 2; i++) {
                // 判断该数是否是素数
                if (checkNum(i) && checkNum(n - i)) {
                    // 保存最小差值
                    if (value == -1 || value > (n - i - i)) {
                        value = n - i - i;
                        min = i;
                        max = n - i;
                    }
                }
            }
            System.out.println(min);
            System.out.println(max);
        }

    }

    // 校验是否为素数
    public static boolean checkNum(int j) {
        boolean flag = true;
        for (int k = 2; k < j; k++) {
            if (j % k == 0) {
                flag = false;
                break;
            }
        }
        return flag;
    }

}