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

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n1, min = Integer.MAX_VALUE;
        int vals[] = new int[1000];
        n1 = in.nextInt();
//        System.out.println(f(n1));
        for (int i = 2; i <= n1 / 2; i++) {
            if (f(i) && f(n1 - i)) {

                vals[n1 - 2 * i] = i;
            }
        }
        for (int i = 0; i < 1000; i++) {
            if (vals[i] != 0) {
                System.out.println(vals[i]);
                System.out.println(n1 - vals[i]);
                break;
            }
        }


    }

    static boolean f(int number) {

        for (int i = 2; i <= number / i; i++) {
            if (number % i == 0) return false;
        }

        return true;

    }
}