summaryrefslogtreecommitdiff
Commit message (Expand)AuthorAgeFilesLines
* 2020: Day 25, all doneHEADmasterDaniel Silverstone2020-12-252-0/+69
* 2020: Add day24Daniel Silverstone2020-12-242-0/+783
* 2020: Get rid of lints in day 18Daniel Silverstone2020-12-231-3/+2
* 2020: Day 23, so inefficient p2 takes over an hourDaniel Silverstone2020-12-232-0/+110
* 2020: Optimise day 22 by not storing whole decks into the prevgames hashDaniel Silverstone2020-12-221-2/+15
* 2020: day22 p2 slow but functionalDaniel Silverstone2020-12-221-4/+60
* 2020: Day22, p1Daniel Silverstone2020-12-222-0/+151
* 2020: Day 21Daniel Silverstone2020-12-213-1/+207
* 2020: Tidy up day20Daniel Silverstone2020-12-201-23/+5
* 2020: day20 part 2Daniel Silverstone2020-12-202-6/+2172
* 2020: Day 20, nowhere near p1 yetDaniel Silverstone2020-12-201-0/+221
* 2020: tweak lib codeDaniel Silverstone2020-12-201-1/+1
* 2020: day19, be cleverer with regexpsDaniel Silverstone2020-12-192-113/+67
* 2020: day19 p2 might work but ughDaniel Silverstone2020-12-191-4/+182
* 2020: day19 p1Daniel Silverstone2020-12-192-0/+750
* 2020: Horrid day 18Daniel Silverstone2020-12-182-0/+598
* 2020: Naïve day17, sets are priceyDaniel Silverstone2020-12-172-0/+173
* 2020: Day16 Stupid bug, fixed nowDaniel Silverstone2020-12-161-3/+3
* 2020; Day 16, works for test input but not for real on p2Daniel Silverstone2020-12-163-1/+485
* 2020: day 15, super naive, day2 will need optimisationDaniel Silverstone2020-12-152-0/+80
* 2020: Very long-hand day14Daniel Silverstone2020-12-142-0/+747
* 2020: Day 13, part 2 was a faffDaniel Silverstone2020-12-132-0/+102
* 2020: Add lcm trait to libDaniel Silverstone2020-12-131-1/+21
* 2020: Add gcd dependencyDaniel Silverstone2020-12-133-0/+30
* 2020: Add day 12, whoopsieDaniel Silverstone2020-12-133-0/+1000
* 2020: day11 naive solutionDaniel Silverstone2020-12-112-0/+374
* 2020: Day 10 turns out to use tribonnacci sequenceDaniel Silverstone2020-12-101-11/+13
* 2020: Solved, but yuckDaniel Silverstone2020-12-101-74/+14
* 2020: day10, struggling with part 2Daniel Silverstone2020-12-102-0/+312
* 2020: Very naive day9, lots of optimisation opportunities hereDaniel Silverstone2020-12-092-0/+1093
* 2020: Naïve approach to day 8Daniel Silverstone2020-12-082-0/+718
* 2020: Day 7, took me far too longDaniel Silverstone2020-12-072-0/+755
* 2020: Add a split-by-pattern approach for not-just-lines inputsDaniel Silverstone2020-12-062-10/+29
* 2020: Day 6 naïve impl was sufficientDaniel Silverstone2020-12-062-0/+2326
* 2020: Day 5, brain first, code laterDaniel Silverstone2020-12-053-0/+962
* 2020: Add naïve day4Daniel Silverstone2020-12-042-0/+1224
* chore: Update outdated depsDaniel Silverstone2020-12-036-53/+26
* chore: cargo updateDaniel Silverstone2020-12-031-52/+62
* 2019: Clean up clippy warningsDaniel Silverstone2020-12-033-9/+6
* 2018: Clean up clippy warningsDaniel Silverstone2020-12-036-43/+16
* 2017: Clean up clippy warningsDaniel Silverstone2020-12-0322-198/+185
* 2016: Clean up clippy warningsDaniel Silverstone2020-12-0325-198/+179
* 2015: Clean up clippy warningsDaniel Silverstone2020-12-0322-87/+78
* clippy: Reduce clippy errors to improve r-a behaviourDaniel Silverstone2020-12-0310-109/+84
* 2020: Completed naive day3Daniel Silverstone2020-12-032-0/+421
* 2020: Initial version of day 2Daniel Silverstone2020-12-022-0/+1063
* 2020: Rewrite day1 to learn some itertoolsDaniel Silverstone2020-12-021-16/+22
* 2020: Day 1 initial solutionDaniel Silverstone2020-12-012-3/+245
* 2020: Prepare the path for aoc2020Daniel Silverstone2020-10-175-4/+168
* chore: Clear warningsDaniel Silverstone2020-07-079-21/+5