题解 | #查找组成一个偶数最接近的两个素数#
查找组成一个偶数最接近的两个素数
http://www.nowcoder.com/practice/f8538f9ae3f1484fb137789dec6eedb9
def isprime(x): if x == 1: return False for i in range(2, x): if x%i == 0: return False return True def func(): while True: try: n = int(input()) cur = int(n/2) for i in range(cur, n): if isprime(i) and isprime(n-i): print(n-i) print(i) break except: break if __name__ == '__main__': func()