Project Euler Problem 10-Summation of primes

还是素数线性筛

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相关推荐

Project Euler Problem 104 Pandigital Fibonacci ends
Pandigital Fibonacci ends Problem 104 The Fibonacci sequence is defined by the recurrence relation: ...
Project Euler Problem 66
Problem 66 Consider quadratic Diophantine equations of the form: x2 – Dy2 = 1 For example, when D=13 ...
Project Euler Problem 27小结
Project Euler上有很多有意思的问题,刚做到第27题,对这个问题做个小结. Problem 27: Euler有一个著名的方程n^2+n+41,当n=0到39时,方程结果均为质数.如今人们用 ...
Project Euler Problem 27 Quadratic primes
Quadratic primes Problem 27 Euler discovered the remarkable quadratic formula: n2+n+41 It turns out ...
Project Euler Problem 92 Square digit chains
Square digit chains Problem 92 A number chain is created by continuously adding the square of the di ...
Project Euler Problem 25 1000-digit Fibonacci number
1000-digit Fibonacci number Problem 25 The Fibonacci sequence is defined by the recurrence relation: ...
Project Euler Problem 14 Longest Collatz sequence
Longest Collatz sequence Problem 14 The following iterative sequence is defined for the set of posit ...
Project Euler Problem 48: Self powers
Self powers Problem 48 The series, 11 + 22 + 33 + ... + 1010 = 10405071317. Find the last ten digits ...
Project Euler Problem 53： Combinatoric selections【组合数】
PE其他解题报告请参考这里,本题答案在留言首条 Combinatoric selections Problem 53 There are exactly ten ways of selecting t ...

Project Euler Problem 10-Summation of primes

Project Euler Problem 10-Summation of primes相关推荐

最新文章

热门文章