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

문제 링크 : https://www.acmicpc.net/problem/9020

9020번: 골드바흐의 추측

def prime_arr():
    nums = [i for i in range(2,10000)]
    p_arr = []
    for num in nums:
        flag = True
        for i in range(2,int(num**0.5)+1):
            if num%i == 0:
                flag = False
                break
        if flag:
            p_arr.append(num)
    return p_arr

p_arr = prime_arr()
def range_arr(e):
    r = [p for p in p_arr if p<e]
    return r

for _ in range(int(input())):
    even = int(input())
    candi = range_arr(even)
    start = even//2
    for _ in range(len(candi)):
        if start in candi and (even-start) in candi:
            print(start,even-start)
            break
        else:
            start -= 1