| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Day 19 | Tom Smeding | 2020-12-25 |
| The second part was supposed to be more difficult than the first part; the problem statement hinted that you might need to memoise the set of sentences matched by non-recursive rules, "especially rules 42 and 31". Why the hell then did my utterly naive matcher from part 1 work without changes in ~60ms total? | |||
 |
index : AOC | |
| My solutions to Advent of Code | git daemon user |
| summaryrefslogtreecommitdiff |