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

import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        scanner.useDelimiter("\n");

        while (scanner.hasNextInt()) {
            int num = scanner.nextInt();
            HashMap<Integer, Integer> hashMap = new HashMap<>();
            int[] res = new int[2];
            int min = num;
            for (int i = 2; i < num; i++) {
                if (is(i) && is(num - i)) {
                    if (Math.abs(num - i - i) < min) {
                        min = Math.abs(num - i - i);
                        res[0] = i;
                        res[1] = num - i;
                    }
                }
            }
            Arrays.stream(res).sorted().forEach(System.out::println);
        }
    }

    public static boolean is(int i) {
        for (int j = 2; j <= Math.sqrt(i); j++) {
             if (i%j==0) {
                 return false;
             }
        }
        return true;
    }
}