summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2016-12-24AOC24Justin Worthe
2016-12-23AOC23Justin Worthe
2016-12-22AOC part 2Justin Worthe
The trick is to round to the nearest 100, so states can be considered 'equivalent' through multiple paths.
2016-12-22AOC22 work in progressJustin Worthe
Has crazy hack optimization to work for the data set, assuming all data is about moving the 'gap' around. It hasn't run to completion yet.
2016-12-22AOC21Justin Worthe
2016-12-20AOC 20Justin Worthe
2016-12-19AOC19 part 2Justin Worthe
Works, but the performance is awful. There must be a better way.
2016-12-19AOC19 part 1Justin Worthe
runs fairly fast, but does not translate easily to part 2
2016-12-18AOC18Justin Worthe
2016-12-17AOC17Justin Worthe
2016-12-16AOC16Justin Worthe
2016-12-15Changed input parsing to decrease number of unwrapsJustin Worthe
2016-12-15AOC15Justin Worthe
2016-12-14AOC14 added memoization of hashing to run in reasonable timeJustin Worthe
2016-12-14AOC14Justin Worthe
Should work for part 2, but the performance isn't there yet
2016-12-13Cleaned up files that should have been in .gitignoreJustin Worthe
2016-12-13AOC13Justin Worthe
2016-12-12Better regexesJustin Worthe
2016-12-12Perf AOC12Justin Worthe
2016-12-12AOC12Justin Worthe
2016-12-11AOC11Justin Worthe
2016-12-10AOC10Justin Worthe
2016-12-09AOC 8 and 9Justin Worthe
2016-12-07AOC7 part 2Justin Worthe
2016-12-07AOC7 part 1Justin Worthe
2016-12-07advent 2+3Justin Worthe
2016-12-06AOC6Justin Worthe
2016-12-05AOC5Justin Worthe
2016-12-05Refactor day 2Justin Worthe
2016-12-02Started AOCJustin Worthe