思路最简单的代码:找n以内的所有素数,然后找出和为n的素数对,判断哪个素数对差最小,并更新

while True:
try:
n=int(input())
result=[]
result=list(range(3,n))
x=[]
flag=1000000000000000000
##求n以内的素数有什么？
for i in range(3,n):
for j in range(2,i):
if i%j==0:
result.remove(i)
break
for i in range(len(result)):
for j in range(i,len(result)):
if result[i]+result[j]==n and result[j]-result[i]<=flag:
flag=result[j]-result[i]
a=result[i]
b=result[j]
break
print(a)
print(b)