Files
python-aoc-2020/day09/part2.py
Sebastian Seedorf 25256f438f Day 9
2020-12-09 11:40:35 +01:00

33 lines
741 B
Python

from collections import deque
from itertools import combinations
lines = [int(x.strip()) for x in open("input.txt")]
L = 25
buffer = deque(maxlen=L)
result = None
for line in lines:
if len(buffer) == L:
found = any(a + b == line for a, b in combinations(buffer, 2))
if not found:
result = line
break
buffer.append(line)
if result is None:
print("No value found")
exit(0)
for start in range(len(lines)):
add = 0
for end in range(start, len(lines)):
add += lines[end]
if add == result:
mi = min(lines[start:end+1])
ma = max(lines[start:end+1])
print(mi+ma)
exit(0)
elif add > result:
break