第1个回答 2018-11-07
def isprime(num,list_p):
for _ in list_p:
if num % _ ==0:
return False
list_p.append(num)
return True
def primes(end,start=2):
p=[2]
n=start+1
while n<=end:
if isprime(n,p):
yield n
n+=1
try:
n=0
while n <= 2:
n=int(input())
for p in primes(n):
print(p)
except:
# no digit
pass