felixm/euler
1
0
Fork 0
Code Pull Requests Releases Activity

Moved problems till 56 to Python.

Browse Source
This commit is contained in:
Felix Martin
2019-07-17 21:29:59 -04:00
parent 301033d17d
commit c624e6ac52
23 changed files with 417 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
python/e050.py
View File

@@ -1,8 +1,33 @@
from lib_prime import primes
def find_max_series(start_index, series_list, series_set):
""" Start at the given index and sum up consecutive primes
into total. If a total is in the series_set (i.e. a prime) then
store the current number of consecutive primes (length) and the total.
If the total exceeds the last value of the given primes no longer
sequence can be found. Return the max sequence length and total. """
series_max = series_list[-1]
total_max = 0
total = 0
for i in range(start_index, len(series_list)):
total = total + series_list[i]
if total in series_set:
length = i - start_index + 1
total_max = total
if total > series_max:
return (length, total_max)
def euler_050():
return 0
n_max = 1000000
ps = primes(n_max)
ps_set = set(ps)
s = max([x for x in [find_max_series(i, ps, ps_set)
for i in range(0, len(ps))] if x])
return s[1]
if __name__ == "__main__":
print("e050.py: " + str(euler_050()))
assert(euler_050() == 0)
assert(euler_050() == 997651)