[BOJ] 백준 9020 골드바흐의 추측

[문제]

https://www.acmicpc.net/problem/9020

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Main {
	static boolean[] prime = new boolean[10001];
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		isPrime();
		int t = Integer.parseInt(br.readLine());
		while(t-->0) {
			int n = Integer.parseInt(br.readLine());
			int result = 0;
			for(int i=1;i<=n/2;i++) {
				if(prime[i] && prime[n-i]) result = i;
			}
			System.out.println(result+" "+(n-result));
		}
	}
	private static void isPrime() {
		Arrays.fill(prime, true);
		prime[0] = prime[1] = false;
		for(int i=2;i*i<=10000;i++) {
			if(!prime[i])
				continue;
			for(int j=i*i;j<=10000;j+=i) {
				prime[j] = false;
			}
		}
	}
}