cupcakearmy/advent-of-code
1
0
Fork 0
mirror of https://github.com/cupcakearmy/advent-of-code.git synced 2026-04-03 03:15:23 +00:00
Code Issues Packages Projects Releases Wiki Activity

day 3

Browse Source
This commit is contained in:
cupcakearmy
2020-12-03 11:25:20 +01:00
parent fad0833836
commit e7ef4e413e
5 changed files with 400 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
solutions/3/README.md Normal file
View File

@@ -0,0 +1,16 @@
# 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.
<details>
<summary>Solutions</summary>
<ol>
<li>252</li>
<li>57 * 252 * 64 * 66 * 43 = 2608962048</li>
</ol>
</details>