zenon/adventofcode2019
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Add python solution for day 2

Browse Source
This commit is contained in:
Tobias Eidelpes 2019-12-02 15:57:13 +01:00
parent 020c54b422
commit ffbe0f66a1
2 changed files with 19 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
day2/input Normal file
View File

@ -0,0 +1 @@
1,12,2,3,1,1,2,3,1,3,4,3,1,5,0,3,2,1,6,19,1,9,19,23,1,6,23,27,1,10,27,31,1,5,31,35,2,6,35,39,1,5,39,43,1,5,43,47,2,47,6,51,1,51,5,55,1,13,55,59,2,9,59,63,1,5,63,67,2,67,9,71,1,5,71,75,2,10,75,79,1,6,79,83,1,13,83,87,1,10,87,91,1,91,5,95,2,95,10,99,2,9,99,103,1,103,6,107,1,107,10,111,2,111,10,115,1,115,6,119,2,119,9,123,1,123,6,127,2,127,10,131,1,131,6,135,2,6,135,139,1,139,5,143,1,9,143,147,1,13,147,151,1,2,151,155,1,10,155,0,99,2,14,0,0

18
day2/python/day2.py Normal file
View File

@ -0,0 +1,18 @@
with open('../input') as f:
content = f.read()
intcode = content.rstrip().split(',')
for i in range(0, len(intcode)):
intcode[i] = int(intcode[i])
for i in range(0, len(intcode), 4):
c = intcode[i]
if c == 99:
break
elif c == 1:
intcode[intcode[i+3]] = intcode[intcode[i+1]] + intcode[intcode[i+2]]
elif c == 2:
intcode[intcode[i+3]] = intcode[intcode[i+1]] * intcode[intcode[i+2]]
print("Solution for Day 2:", intcode[0])