| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Solve day 13 part 1 | June McEnroe | 2021-12-13 |
| | | |||
| * | Pop instead of shift | June McEnroe | 2021-12-12 |
| | | | | | BFS isn't needed. This uses less memory and time. | ||
| * | Solve day 12 part 2 | June McEnroe | 2021-12-12 |
| | | |||
| * | Solve day 12 part 1 | June McEnroe | 2021-12-12 |
| | | |||
| * | Solve day 11 part 2 | June McEnroe | 2021-12-11 |
| | | |||
| * | Solve day 11 part 1 | June McEnroe | 2021-12-11 |
| | | |||
| * | Solve day 10 part 2 | June McEnroe | 2021-12-10 |
| | | |||
| * | Solve day 10 part 1 | June McEnroe | 2021-12-10 |
| | | |||
| * | Solve day 9 part 2 | June McEnroe | 2021-12-09 |
| | | |||
| * | Solve day 9 part 1 | June McEnroe | 2021-12-09 |
| | | |||
| * | Solve day 8 part 2 | June McEnroe | 2021-12-08 |
| | | | | | That took me way too long from dumb mistakes. | ||
| * | Solve day 8 part 1 | June McEnroe | 2021-12-08 |
| | | |||
| * | Solve day 7 part 2 | June McEnroe | 2021-12-07 |
| | | |||
| * | Solve day 7 part 1 | June McEnroe | 2021-12-07 |
| | | |||
| * | Use postfix for more | June McEnroe | 2021-12-06 |
| | | |||
| * | Solve day 6 part 2 | June McEnroe | 2021-12-06 |
| | | |||
| * | Solve day 6 part 1 | June McEnroe | 2021-12-06 |
| | | |||
| * | Solve day 5 part 2 | June McEnroe | 2021-12-05 |
| | | |||
| * | Solve day 5 part 1 | June McEnroe | 2021-12-05 |
| | | |||
| * | Solve day 4 part 2 | June McEnroe | 2021-12-04 |
| | | | | | This is hilariously bad. | ||
| * | Solve day 4 part 1 | June McEnroe | 2021-12-04 |
| | | | | | | Gave up on perl and then spent way too long trying to get this parsed correctly in C. This code is pretty bad even for AoC. | ||
| * | Refactor day 3 using grep to count ones | June McEnroe | 2021-12-03 |
| | | | | | C has turned my brain to for-loop goop. | ||
| * | Solve day 3 part 2 | June McEnroe | 2021-12-03 |
| | | |||
| * | Solve day 3 part 1 | June McEnroe | 2021-12-03 |
| | | |||
| * | Solve day 2 part 2 | June McEnroe | 2021-12-02 |
| | | |||
| * | Solve day 2 part 1 | June McEnroe | 2021-12-02 |
| | | |||
| * | Solve day 1 part 2 | June McEnroe | 2021-12-01 |
| | | |||
| * | Solve day 1 part 1 | June McEnroe | 2021-12-01 |
| | | |||
| * | Solve day 18 part 2 | June McEnroe | 2020-12-18 |
| | | | | | | | | Is it cheating to implement the FORTRAN I approach[1] as preprocessing? Maybe. [1]: https://en.wikipedia.org/wiki/Operator-precedence_parser#Alternative_methods | ||
| * | Solve day 18 part 1 | June McEnroe | 2020-12-18 |
| | | |||
| * | Solve day 17 part 2 | June McEnroe | 2020-12-17 |
| | | |||
| * | Solve day 17 part 1 | June McEnroe | 2020-12-17 |
| | | |||
| * | Solve day 16 part 2 | June McEnroe | 2020-12-16 |
| | | |||
| * | Solve day 16 part 1 in C | June McEnroe | 2020-12-16 |
| | | |||
| * | Solve day 16 part 1 | June McEnroe | 2020-12-16 |
| | | | | | Oh god I barely know what I'm doing in perl. | ||
| * | Update day 14 part 2 with the clever way | June McEnroe | 2020-12-15 |
| | | |||
| * | Solve day 15 part 2 | June McEnroe | 2020-12-15 |
| | | |||
| * | Solve day 15 part 1 | June McEnroe | 2020-12-15 |
| | | |||
| * | Rewrite day 14 to log all writes then sort them | June McEnroe | 2020-12-14 |
| | | | | | Down from 1.56s to 0.04s. | ||
| * | "Allocate" only 4 MB rather than 1 TB for day 14 part 2 | June McEnroe | 2020-12-14 |
| | | | | | | There are <512 writes in the input data, and at most 9 bits floating. Doesn't really matter much, though. | ||
| * | Solve day 14 part 2 | June McEnroe | 2020-12-14 |
| | | | | | Quite messy but it works. | ||
| * | Solve day 14 part 1 | June McEnroe | 2020-12-14 |
| | | |||
| * | Spoiled solve day 13 part 2 | June McEnroe | 2020-12-13 |
| | | | | | | | I think I might've been close to coming up with this at some point but everyone was acting like it was impossible without knowing "Chinese Remainder Theorem" and I just got pissed off. | ||
| * | Solve day 13 part 1 | June McEnroe | 2020-12-13 |
| | | |||
| * | Solve day 12 part 2 | June McEnroe | 2020-12-12 |
| | | | | | | In classic fashion, I typo'd an x as a y and failed to catch it until reading over the code for the 5th time. | ||
| * | Solve day 12 part 1 | June McEnroe | 2020-12-12 |
| | | |||
| * | Solve day 11 part 2 | June McEnroe | 2020-12-11 |
| | | |||
| * | Solve day 11 part 1 | June McEnroe | 2020-12-11 |
| | | |||
| * | Solve day 10 part 2 | June McEnroe | 2020-12-10 |
| | | | | | | Much tougher than part 1. I got tripped up on using an int where I needed a long again. That number is huge! | ||
| * | Solve day 10 part 1 | June McEnroe | 2020-12-10 |
| | | | | | Trivial?? | ||