题解 | #查找组成一个偶数最接近的两个素数#
import sys
def is_prime(n):
for i in range(2, int(n**0.5)+1):
if n%i==0:
return False
return True
for line in sys.stdin:
num=int(line.strip())
N=num//2
start= 0 if N%2==1 else 1
for i in range(start,N-1,2):
a, b = N-i,N+i
if is_prime(a) and is_prime(b):
print(a)
print(b)
break
查看1道真题和解析
