Add a python version and the summary/answers for both parts
[advent-of-code-2020.git] / day15 / memory.py
1 #!/usr/bin/python3
2
3 from collections import deque
4
5 def get_answer(initial_data, end_count):
6     x=len(initial_data)
7     seen={}
8     for index,number in enumerate(initial_data,1):
9         seen[number]=index
10     last_answer=initial_data[-1]
11     while x < end_count:
12         answer=0
13         if last_answer in seen:
14             answer=x-seen[last_answer]
15         seen[last_answer]=x
16         x+=1
17         last_answer=answer
18         yield answer
19
20
21 initial_data=[int(a) for a in open("input.txt", "r").readline().split(",")]
22
23 print("Part 1: ", deque((get_answer(initial_data,2020)),maxlen=1).pop())
24 print("Part 2: ", deque((get_answer(initial_data,30000000)),maxlen=1).pop())