题解 | #查找组成一个偶数最接近的两个素数#
查找组成一个偶数最接近的两个素数
https://www.nowcoder.com/practice/f8538f9ae3f1484fb137789dec6eedb9
import re
import sys
def do(num):
result = []
# 求出两个值N，M-N
# 判断是否为素数如果是则记录
# 记录下来后进行排序看选择哪组
if num == 2:
result.append((1, 1))
elif num > 2:
for i in range(1, int(num/2)+1):
other = num - i
i_is_sushu = True
other_is_sushu = True
for item in range(2, i):
if i % item == 0:
i_is_sushu = False
for item in range(2, other):
if other % item == 0:
other_is_sushu = False
if i_is_sushu and other_is_sushu:
result.append((i, other))
# print('{}'.format(result))
result.sort(key=lambda x: x[1]-x[0])
# print('{}'.format(result))
return result[0]
if __name__ == '__main__':
num = int(sys.stdin.readline().strip())
r = do(num)
print(r[0])
print(r[1])
查看17道真题和解析
，