백준 9020번 자바 : 골드바흐의 추측

import java.util.Scanner;

public class Main {

	static boolean[] prime = new boolean[10001];
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		get_prime();
		for(int i=0;i<t;i++) {
			int num = in.nextInt();
			for(int j = num / 2; j>1; j--) {
				if(!prime[j] && !prime[num-j]) {
					System.out.println(j + " " +(num-j));
					break;
				}
			}
		}

	}

	static void get_prime() {
		prime[0] = prime[1] = true;

		for(int i = 2; i <= Math.sqrt(prime.length); i++) {
			if(prime[i]) continue;
			for(int j = i * i; j < prime.length; j += i) {
				prime[j] = true;
			}
		}
	}
}