summaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAge
* Fix warnings in day 17Tom Smeding2018-12-18
|
* Optimise day 17 a bittomsmeding2018-12-17
|
* Day 17tomsmeding2018-12-17
| | | | | | This was a really fun one! Enjoyed making the simulation that is really a complicated kind of automaton, and enjoyed looking at the automaton doing its thing in the terminal.
* Day 16tomsmeding2018-12-16
|
* Make benchmark module less incorrecttomsmeding2018-12-15
|
* Day 15tomsmeding2018-12-15
| | | | | | | | God dammit this one wasn't fun. The amount of edge cases and arbitrary rules made this more of a chore than a puzzle. The code could probably be shorter, but any sane amount of code structure and clarity demanded this size.
* Own crappy benchmarking moduletomsmeding2018-12-15
|
* Day 14tomsmeding2018-12-14
|
* Fix warnings in day13tomsmeding2018-12-14
|
* Day 13 part 2Tom Smeding2018-12-13
|
* Day 13 part 1Tom Smeding2018-12-13
|
* Day 12Tom Smeding2018-12-12
|
* Optimise day 11Tom Smeding2018-12-12
|
* Day 11Tom Smeding2018-12-11
|
* Optimise day 10tomsmeding2018-12-10
|
* Day 10tomsmeding2018-12-10
|
* Optimise day 6tomsmeding2018-12-09
|
* Run from crate root, not src/tomsmeding2018-12-09
|
* @lieuwex is a better cargo fix --edition-idiomstomsmeding2018-12-09
|
* cargo fix --edition-idiomstomsmeding2018-12-09
|
* Day 9tomsmeding2018-12-09
|
* Day 8tomsmeding2018-12-08
|
* Day 7tomsmeding2018-12-07
|
* Day 7 WIPTom Smeding2018-12-07
|
* Day 6Tom Smeding2018-12-06
|
* Day 5 + benchmarkingTom Smeding2018-12-05
|
* Day 4Tom Smeding2018-12-04
|
* Day 3tomsmeding2018-12-03
|
* Day 2tomsmeding2018-12-02
|
* Start 2018!tomsmeding2018-12-01
|
* Christmas! 🎄tomsmeding2017-12-25
|
* Day 24tomsmeding2017-12-24
|
* Day 23tomsmeding2017-12-23
| | | | Nice one, having to actually look at the input for once. :)
* Day 22tomsmeding2017-12-22
| | | | | | Haskell version is waaaaay too slow and uses huge amounts of memory. Didn't even let it run to completion on part 2. The C version is really quick. /shrug/
* Day 21tomsmeding2017-12-21
| | | | | Please compile this, and even then running takes about a minute on my PC. This is a SLOW implementation, but it works.
* Day 20tomsmeding2017-12-20
| | | | | | This gives the right answer, but that 100 is a HIGHLY magic constant. Increase if incorrect. `prune` should work, but doesn't for some reason. This is sad but I've spent enough time on this as is.
* Day 19tomsmeding2017-12-19
|
* Day 18tomsmeding2017-12-18
| | | | | | I misread part 2 thinking that 'rcv 0' still shouldn't do anything. It should. That solved some problems. As in, let it work first try afterwards.
* Day 17tomsmeding2017-12-17
| | | | | You want to compile this for part 2. Inefficient, but works. Reusing part 1 was so inefficient that it blew up my memory.
* Day 16 btomsmeding2017-12-16
|
* Day 16 atomsmeding2017-12-16
|
* Day 15tomsmeding2017-12-15
| | | | | Generators are cool. Please compile this, otherwise it will burn your CPU.
* Day 14tomsmeding2017-12-14
| | | | | | | Honestly, I'm surprised that this is even remotely fast. The usage of plain linked-list strings should make this horrifyingly slow, but apparently, the combination of an optimising GHC and a not-too-large map (apparently) make this tractable.
* Day 13tomsmeding2017-12-13
|
* Day 12tomsmeding2017-12-12
|
* Day 11tomsmeding2017-12-11
|
* Day 10tomsmeding2017-12-10
| | | | That was a really long description. Fun hash though.
* Day 9tomsmeding2017-12-09
|
* Day 8tomsmeding2017-12-08
|
* Day 7tomsmeding2017-12-07
| | | | | | This one was already just a tiny bit harder, because I failed to notice there were multiple unbalanced nodes. Filtering out parents proved to be a success.
generated by cgit v1.2.3-70-g09d2 (git 2.47.0) at 2024-12-29 07:13:43 +0100