tried to solve this one using only incrementing sums, which worked fine for the test input but not the actual puzzle input. By a complete rewrite to actually render the tree as a map, it worked. The spontanious data store is a mess and cost me much time to work around, since I wanted to have a list of tuples with all the sizes for each directory. Took 2 days to figure this one out. Not proud. |
||
|---|---|---|
| .. | ||
| lib | ||
| test | ||
| .formatter.exs | ||
| .gitignore | ||
| mix.exs | ||
| README.md | ||
Aoc
Solutions for Advent of Code 2021, this year in Elixir.
Elixir 1.12.0 preferred.
Help scripts
Run tests using mix test as usual.
Create input file, test file and solution file for a day, using day 1 as example:
mix Aoc.new 1 "Name of the puzzle"
Solve a single puzzle, using puzzle from day 3 as example:
mix Aoc.solve 3
Solve all puzzles, starting at the first:
mix Aoc.solve_all
Log
Advent of Code has not started yet. See you in December!