def allPrime(maxNum):
aList = [x for x in range(0,maxNum)]
prime = []
for i in range(2,len(aList)):
if aList[i] != 0:
prime.append(aList[i])
clear(aList[i],aList,maxNum)
print prime
def clear(aPrime,aList,maxNum):
for i in range(2,int((maxNum/aPrime)+1)):
if not aPrime*i>maxNum-1:
aList[i*aPrime]=0
allPrime(1000)
温馨提示:答案为网友推荐,仅供参考