-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathP50.py
46 lines (37 loc) · 889 Bytes
/
P50.py
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
# -*- coding: utf-8 -*-
from Euler_Lib import eratosthenes
primes=eratosthenes(1000000)
primes_test=set(primes)
position=0
limit=len(primes)
max_length=2
result=0
#for i in range(len(primes)):
# length=2
# test=0
#
# while test<primes[-1]:
# end=i+length
# if end>limit:
# break
# test=sum(primes[i:end])
# if test in primes_test:
# if length>max_length:
# max_length=length
# result=test
# length+=1
while position<limit:
length=2
test=0
while test<primes[-1]:
end=position+length
if end>=limit:
break
test=sum(primes[position:end])
if test in primes_test:
if length>max_length:
max_length=length
result=test
length+=1
position+=1
print(result)