python 素数判断 偶数分解为两个素数差最小值

本人解法：

def issushu(x):
    for i in range(2,x//2+1):
        if x%i==0:
            return False
    return True

while True:
    try:
        in_int = int(input())
        b = in_int//2
        for i in range(b):
            a = in_int//2+i
            b = in_int//2-i
            if issushu(a) and issushu(b):
                print(b)
                print(a)
                break
    except:
        break

大家解法

import math
def isPrime(a): #注意记住判断素数的函数
    for i in range(2,int(math.sqrt(a))+1):
        if a%i==0:
            return False
    return True

while True:
    try:
        a=int(input())
        b=a//2
        for i in range(b,0,-1):
            if isPrime(i) and isPrime(a-i):
                print(i)
                print(a-i)
                break
    except:
        break