python双素数_Python编程：筛法求两个数之间的素数

要求计算最多10组，每组由两个数m,n构成(1<=m<=n<=1000000000,n-m<100000),要求打印出m,n之间的所有素数(包括m,n)，时间限制6s。下面是我采用筛法写的python代码，但是仍然超时，到底是哪里错了呢？

我写的代码：

from math import sqrt

def PrimeGenerator():

n = input()

a = range(n)

for i in range(n):

a[i] = raw_input().split()

for aa in a:

start = int(aa[0])

end = int(aa[-1])

length = end - start + 1

l = [True] * length

for i in range(2, int(sqrt(end)) + 1): # 筛子

if start == 1: # 排除1

k = i * 2

while k <= end:

l[k-start] = False

k += i

l[0] = False

elif start == 2: # 2是素数

k = i * 2

while k <= end:

l[k-start] = False

k += i

else: # 有一些下限值小于筛子的情况

k = start <= i and i * 2 or i * (start / i)

while k <= end:

if k >= start:

l[k-start] = False

k += i

for i in range(length):

if l[i]:

print i + start

print

PrimeGenerator()