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

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();
        int a = 0;
        int b = 0;
        int diff = Integer.MAX_VALUE;

        for (int i = 2; i <= num / 2; i++) {
            if ((isPrime(i)) && (isPrime(num - i))) {
                if (num - i - i < diff) {
                    a = i;
                    b = num - i;
                    diff = num - i - i;
                }
            }
        }

        System.out.println(a);
        System.out.println(b);
    }

    static boolean isPrime(int n) {
        for (int i = 2; i <= n / i; i++) {
            if (n % i == 0) return false;
        }
        return true;
    }
}