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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
from functools import reduce
from typing import List, Generator
from aoc import BaseAssignment
class Assignment(BaseAssignment):
def read_input(self, example = False) -> List:
return list(super().read_input(example))
def slope(self, input: List, dx: int, dy: int) -> Generator:
for y, row in enumerate(input[::dy]):
x = (y * dx) % len(row)
yield (x, y)
def get_trees_for_slope(self, input: List, dx: int, dy: int):
trees = 0
for x, y in self.slope(input, dx, dy):
if x == 0 and y == 0:
continue
if (input[y * dy][x]) == '#':
trees += 1
return trees
class AssignmentOne(Assignment):
def run(self, input: List):
return self.get_trees_for_slope(input, 3, 1)
class AssignmentTwo(Assignment):
def run(self, input: List):
return reduce(lambda accumulator, value: accumulator * value, [
self.get_trees_for_slope(input, 1, 1),
self.get_trees_for_slope(input, 3, 1),
self.get_trees_for_slope(input, 5, 1),
self.get_trees_for_slope(input, 7, 1),
self.get_trees_for_slope(input, 1, 2),
])
|