blob: 615f0d5df3c45d5803850701db4a5f116e4ec5fa (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
|
from common import sieve
limit = 1000000
prime_set = sieve(limit).primes()
prime_list = list(prime_set)
prime_list.sort()
n = len(prime_list)
max_sum = 0
max_count = 0
for i in xrange(n):
sum = prime_list[i]
count = 1
for j in xrange(i+1, n):
sum += prime_list[j]
count += 1
if sum > prime_list[-1]:
break
if sum in prime_set and count > max_count:
max_sum = sum
max_count = count
print max_sum
|
