题解 | #查找组成一个偶数最接近的两个素数#
查找组成一个偶数最接近的两个素数
https://www.nowcoder.com/practice/f8538f9ae3f1484fb137789dec6eedb9?tpId=37&tqId=21283&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D2%26tpId%3D37%26type%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=
n = int(input())
def isprime(i):
for j in range(2, i - 1):
if i % j == 0:
return False
return True
def findprime(n):
if n==4:
return [2,2]
for i in range(int(n / 2), 2, -1):
if isprime(i):
if isprime(n - i):
return [i, n - i]
L=findprime(n)
print(L[0])
print(L[1])
查看14道真题和解析