Jan Christian Grünhage 580f6259bc implement day 17 ... this is horrible, I'm not proud of it. There surely is some mathematical feature that allows a smarter solution, but after I've not been able to find that for a while, I've decided to just brute force it. Due to that, I've not had any motivation to finish this solution on time or to remove the loads of redundant code I've written here..		2021-12-18 18:10:16 +01:00
..
day_04	fix clippy lints	2021-12-05 11:10:03 +01:00
day_05	refactor parse_n to not require borrowing closures	2021-12-13 07:35:55 +01:00
day_06	implement day 6	2021-12-07 10:43:19 +01:00
day_07	implement day 7	2021-12-07 10:43:19 +01:00
day_08	implement day 8	2021-12-09 08:11:59 +01:00
day_09	implement day 9	2021-12-10 08:17:38 +01:00
day_10	implement day 10	2021-12-10 16:20:53 +01:00
day_11	refactor parse_n to not require borrowing closures	2021-12-13 07:35:55 +01:00
day_12	refactor parse_n to not require borrowing closures	2021-12-13 07:35:55 +01:00
day_13	implement day 13	2021-12-13 07:35:55 +01:00
day_14	implement day 14	2021-12-16 00:08:46 +01:00
day_15	implement day 15	2021-12-16 00:09:04 +01:00
day_16	implement day 16 part 2	2021-12-16 14:42:27 +01:00
day_17	implement day 17	2021-12-18 18:10:16 +01:00
day_18	implement day 18	2021-12-18 18:08:53 +01:00
day_xx	add template	2021-12-09 08:30:06 +01:00
day_01.rs	add slice window variants for day 1	2021-12-04 23:49:22 +01:00
day_02.rs	fix clippy lints	2021-12-05 11:10:03 +01:00
day_03.rs	port day 3 to bitvec	2021-12-07 10:43:19 +01:00
lib.rs	implement day 17	2021-12-18 18:10:16 +01:00
parsing.rs	make parse_number fallible	2021-12-18 17:28:06 +01:00