還是素數線性篩

MAXN = 2000000 prime = [0 for i in range(MAXN+1)]res = 0 for i in range(2,MAXN+1):if prime[i] == 0:res += iprime[0] += 1prime[prime[0]] = ij = 1while j <= prime[0] and prime[j]<=MAXN/i:prime[prime[j]*i] = 1if i%prime[j] == 0:breakj += 1print res

轉載于:https://www.cnblogs.com/guoyongheng/p/7572103.html

總結

以上是生活随笔為你收集整理的Project Euler Problem 10-Summation of primes的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。