1013 数素数 (20 分)
网上找了python计算素数的代码
def prime(n,result):
flag = [1]*(n+2)
p=2
while(p<=n):
result.append(p)
for i in range(2*p,n+1,p):
flag[i] = 0
while 1:
p += 1
if(flag[p]==1):
break
然后自己写了下输出的代码:
for i in range(len(final)):
if i % 10 ==9:
print(final[i])
elif i % 10 == 0 and i != (len(final)-1):
print(final[i],end = " ")
elif i == (len(final)-1):
print(final[i])
else:
print(final[i],end = " ")
最后总代码:
nums = input().split()
M = int(nums[0])
N = int(nums[1])
def prime(n,result):
flag = [1]*(n+2)
p=2
while(p<=n):
result.append(p)
for i in range(2*p,n+1,p):
flag[i] = 0
while 1:
p += 1
if(flag[p]==1):
break
result = []
prime(200000,result)
final = result[M-1:N]
for i in range(len(final)):
if i % 10 ==9:
print(final[i])
elif i % 10 == 0 and i != (len(final)-1):
print(final[i],end = " ")
elif i == (len(final)-1):
print(final[i])
else:
print(final[i],end = " ")