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

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNextInt()) {
            int n = in.nextInt();
            if (IsSuShu(n / 2)) {
                System.out.print(n / 2 + "\n" + n / 2);
            } else {
                //如num=10, 遍历:5,6,7,8
                // 从最接近的两个中位数开始处理判断
                for (int i = n / 2; i < n - 1; i++) {
                    if (IsSuShu(i) && IsSuShu(n - i)) {
                        System.out.println((n - i) + "\n" + i);
                        return;
                    }
                }
            }
        }
    }

    //判断是否是素数
    public static boolean IsSuShu(int x) {
        if (x <= 1) {
            return false; // 1 and numbers less than 1 are not prime
        }
        for (int i = 2; i * i <= x; i++) {
            if (x % i == 0) {
                return false;
            }
        }
        return true;
    }
}