def zhao_primes(): primes = [2] for i in range(3, 101): for j in range(2, int(i ** 0.5) + 1): if i % j == 0: break else: primes.append(i) return primes def sushu_he(primes): for i in range(6, 101, 2): # 确保 i 是偶数 found = False for j in primes: # j 是第一个素数 if j > i // 2: # 避免重复计算，j 不应大于 i 的一半 break k = i - j if k in primes: print("{}={}+{}".format(i, j, k)) found = True break # 找到一种表示后立即退出循环 primes=zhao_primes() sushu_he(primes)