My solutions for Advent of Code.
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
#!/usr/bin/env python
|
|
|
|
|
from aoc import get_input
|
|
|
|
|
|
|
|
|
|
inp = get_input(3).splitlines()
|
|
|
|
|
|
|
|
|
|
mapp = inp
|
|
|
|
|
|
|
|
|
|
maplen = len(mapp)
|
|
|
|
|
|
|
|
|
|
def slope(a, b):
|
|
|
|
|
trees = 0
|
|
|
|
|
x, y = 0, 0
|
|
|
|
|
|
|
|
|
|
while True:
|
|
|
|
|
try:
|
|
|
|
|
x += a
|
|
|
|
|
y += b
|
|
|
|
|
|
|
|
|
|
if( x >= len(mapp[0]) ):
|
|
|
|
|
x = x - len(mapp[0])
|
|
|
|
|
|
|
|
|
|
if( mapp[y][x] == "#" ):
|
|
|
|
|
trees += 1
|
|
|
|
|
except:
|
|
|
|
|
break
|
|
|
|
|
|
|
|
|
|
return trees
|
|
|
|
|
|
|
|
|
|
tree1 = slope(3, 1)
|
|
|
|
|
print("1:", tree1)
|
|
|
|
|
|
|
|
|
|
tree2 = slope(1, 1) * tree1 * slope(5, 1) * slope(7, 1) * slope(1, 2)
|
|
|
|
|
print("2:", tree2)
|
