summary refs log tree commit diff homepage
Commit message (Collapse)AuthorAge
* Solve day 9 part 2June McEnroe2022-12-09
|
* Solve day 9 part 1June McEnroe2022-12-09
|
* Solve day 8 part 2June McEnroe2022-12-08
|
* Solve day 8 part 1June McEnroe2022-12-08
|
* Solve day 7 part 2June McEnroe2022-12-07
|
* Solve day 7 part 1June McEnroe2022-12-07
|
* Solve day 6 part 2June McEnroe2022-12-06
|
* Solve day 6 part 1June McEnroe2022-12-06
|
* Solve day 5 part 2June McEnroe2022-12-05
|
* Solve day 5 part 1June McEnroe2022-12-05
|
* Solve day 4 part 2June McEnroe2022-12-04
|
* Solve day 4 part 1June McEnroe2022-12-04
|
* Solve day 3 part 2June McEnroe2022-12-04
|
* Solve day 3 part 1June McEnroe2022-12-04
|
* Solve day 2 part 2June McEnroe2022-12-02
|
* Solve day 2 part 1June McEnroe2022-12-02
|
* Solve day 1 part 2June McEnroe2022-12-01
|
* Solve day 1 part 1June McEnroe2022-12-01
|
* Solve day 14 part 2June McEnroe2021-12-15
|
* Solve day 14 part 1June McEnroe2021-12-14
|
* Solve day 13 part 2June McEnroe2021-12-13
|
* Solve day 13 part 1June McEnroe2021-12-13
|
* Pop instead of shiftJune McEnroe2021-12-12
| | | | BFS isn't needed. This uses less memory and time.
* Solve day 12 part 2June McEnroe2021-12-12
|
* Solve day 12 part 1June McEnroe2021-12-12
|
* Solve day 11 part 2June McEnroe2021-12-11
|
* Solve day 11 part 1June McEnroe2021-12-11
|
* Solve day 10 part 2June McEnroe2021-12-10
|
* Solve day 10 part 1June McEnroe2021-12-10
|
* Solve day 9 part 2June McEnroe2021-12-09
|
* Solve day 9 part 1June McEnroe2021-12-09
|
* Solve day 8 part 2June McEnroe2021-12-08
| | | | That took me way too long from dumb mistakes.
* Solve day 8 part 1June McEnroe2021-12-08
|
* Solve day 7 part 2June McEnroe2021-12-07
|
* Solve day 7 part 1June McEnroe2021-12-07
|
* Use postfix for moreJune McEnroe2021-12-06
|
* Solve day 6 part 2June McEnroe2021-12-06
|
* Solve day 6 part 1June McEnroe2021-12-06
|
* Solve day 5 part 2June McEnroe2021-12-05
|
* Solve day 5 part 1June McEnroe2021-12-05
|
* Solve day 4 part 2June McEnroe2021-12-04
| | | | This is hilariously bad.
* Solve day 4 part 1June McEnroe2021-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 onesJune McEnroe2021-12-03
| | | | C has turned my brain to for-loop goop.
* Solve day 3 part 2June McEnroe2021-12-03
|
* Solve day 3 part 1June McEnroe2021-12-03
|
* Solve day 2 part 2June McEnroe2021-12-02
|
* Solve day 2 part 1June McEnroe2021-12-02
|
* Solve day 1 part 2June McEnroe2021-12-01
|
* Solve day 1 part 1June McEnroe2021-12-01
|
* Solve day 18 part 2June McEnroe2020-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