我想通过解决项目欧拉问题来学习python。我卡在问题58.问题状态因此:Python代码冻结了我的电脑 - 项目欧拉58
Starting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed.
37 36 35 34 33 32 31
38 17 16 15 14 13 30
39 18 5 4 3 12 29
40 19 6 1 2 11 28
41 20 7 8 9 10 27
42 21 22 23 24 25 26
43 44 45 46 47 48 49
It is interesting to note that the odd squares lie along the bottom right diagonal, but what is more interesting is that 8 out of the 13 numbers lying along both diagonals are prime; that is, a ratio of 8/13 ≈ 62%.
If one complete new layer is wrapped around the spiral above, a square spiral with side length 9 will be formed. If this process is continued, what is the side length of the square spiral for which the ratio of primes along both diagonals first falls below 10%?
这是我写的解决此问题的代码。我利用primesieve来检查素数,但我不知道设置primesieve的限制。所以我让代码告诉我什么时候需要增加限制。代码运行良好,限制为10^8,但是当我将其设置为10^9时,代码冻结了我的PC,我必须重新启动。不知道我做错了什么。如果您需要更多信息,请告诉我。谢谢!
def primesieve(limit):
primelist=[]
for i in xrange(limit):
primelist.append(i)
primelist[1]=0
for i in xrange(2,limit):
if primelist[i]>0:
ctr=2
while (primelist[i]*ctr<limit):
a=primelist[i]*ctr
primelist[a]=0
ctr+=1
primelist=filter(lambda x: x!=0, primelist)
return primelist
limit=10**7
plist=primesieve(limit)
pset=set(plist)
diagnumbers=5.0
primenumbers=3.0
sidelength=3
lastnumber=9
while (primenumbers/diagnumbers)>=0.1:
sidelength+=2
for i in range(3):
lastnumber+=(sidelength-1)
if lastnumber in pset:
primenumbers+=1
diagnumbers+=4
lastnumber+=(sidelength-1)
if lastnumber>plist[-1]:
print lastnumber,"Need to increase limit"
break
print "sidelength",sidelength," last number",lastnumber,(primenumbers/diagnumbers)
你可能会看看http://stackoverflow.com/q/2068372/344286关于改善你的筛子的一些提示 –
项目欧拉是强力的点不会解决问题,你需要做一些数学减少所需的计算量/存储量。 –