cupcakearmy
/
advent-of-code
mirror of https://github.com/cupcakearmy/advent-of-code.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
advent-of-code/2020/solutions/3
History
cupcakearmy e88c99bb86
move to 2020 fodler 		2021-12-01 11:43:46 +01:00
..
go move to 2020 fodler 2021-12-01 11:43:46 +01:00
python move to 2020 fodler 2021-12-01 11:43:46 +01:00
README.md move to 2020 fodler 2021-12-01 11:43:46 +01:00
data.txt move to 2020 fodler 2021-12-01 11:43:46 +01:00
test.txt move to 2020 fodler 2021-12-01 11:43:46 +01:00

README.md

3

We can simply parse the forest as an array of strings. The trees repeat infinitely to the right, this screams for a good mod. This means: char = row[x % len(row)]. No complex logic needed

For the second one we simply automate the process and sum up the total. We can simply encode the coordinates as a function of the index we are current at.

Solutions
  1. 252
  2. 57 * 252 * 64 * 66 * 43 = 2608962048