import math
a = input()
Prime_number = []
interregional = a.split(" ")
def is_prime(n):
if n == 1:
return False
for i in range(2, int(math.sqrt(n))+1):
if n % i == 0:
return False
return True
for i in range(1,int(math.pow(2,31)-1)):
if len(Prime_number)>int(interregional[1]):
break
else:
if is_prime(i):
Prime_number.append(i)
else:
continue
last_Prime_number = Prime_number[int(interregional[0])-1:int(interregional[1])]
for k in range(1,len(last_Prime_number)+1):
if k ==len(last_Prime_number):
print(last_Prime_number[k-1])
elif k%10 == 0:
print(last_Prime_number[k-1],end="\n")
else:
print(last_Prime_number[k-1],end=" ")
这也太难了吧!!!提交结果如下: