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
|
#advent of code 2020
#day 03
grid = dict();
limY = 0;
limX = 0;
PuzzleInput = open("03.in","r");
for y,line in enumerate(PuzzleInput):
for x, c in enumerate(line):
grid[(x,y)] = c;
limX = max(limX,x);
limY = max(limY,y);
PuzzleInput.close();
slopes = [(1,1),(3,1),(5,1),(7,1),(1,2)];
p1 = 0;
p2 = 1;
for slope in slopes:
stepX, stepY = slope;
MyPosX = 0;
MyPosY = 0;
trees = 0;
while MyPosY < limY :
MyPosX += stepX;
MyPosY += stepY;
if grid[(MyPosX%limX),MyPosY] == "#": trees +=1;
p2 *= trees;
if slope == (3,1): p1 += trees;
print("part 1 = ",p1);
print("part 2 = ",p2);
|
