有那么一丢丢思路,但是好像能力不够,写不完美,只能先CV一份了
import itertools
def prime(n):
for i in range(2,n):
if n % i == 0:
return 0
return 1
l=[]
res=[]
for i in range(2,10000):
if prime(i):
l.append(i)
com = list(itertools.combinations(l,2))
for i in range(4,10000,2):
for m in com:
if i == sum(m):
res.append(min(m))
break
print(max(res))