def prime_1(a):
a = int(a)
for i in (2,a+1):
if a%i == 0:
return False
elif(a!=1):
return True
def sum_prime(m,n):
list_prime = []
for i in range(m,n+1):
if prime_1(i) :
list_prime.append(i)
return sum(list_prime)
用函数求素数和python练习题下面展示一些 内联代码片。def prime_1(a): a = int(a) for i in (2,a+1): if a%i == 0: return False elif(a!=1): return Truedef sum_prime(m,n): list_prime = [] for i in range(m,n+1): if