magical
484491426d
day 9 part 2
...
it seemed easier to go for a sparse implementation than try to make the
dense implementation from part 1 work
2024-12-09 17:46:27 +00:00
magical
f0eff608ae
day 9 part 1
2024-12-09 05:32:15 +00:00
magical
7e2e395314
day 8
2024-12-08 05:20:33 +00:00
magical
7373859412
day 7 optimization
...
instead of lists, construct a tower of nested generators. i think this
is equivalent to a recursive backtracking solution.
since the input doesn't contain 0 we can check for <goal in the
intermediate layers, and ==goal at the end.
2024-12-07 21:02:18 +00:00
magical
9e083f00f9
day 7
2024-12-07 05:43:17 +00:00
magical
ece6ff1139
day 6 reduce state size
2024-12-06 05:51:15 +00:00
magical
67cd627138
day 6 part 2
2024-12-06 05:49:05 +00:00
magical
c40379371e
day 6 part 1
2024-12-06 05:19:41 +00:00
magical
ba3639a098
day 5 cleanup
2024-12-05 08:11:46 +00:00
magical
eeff5e846c
day 5 part 2
2024-12-05 08:07:02 +00:00
magical
ccc463cf17
day 5 part 1
2024-12-05 07:52:55 +00:00
magical
7f8e50b15f
ignore executables
2024-12-04 07:29:50 +00:00
magical
babad98e13
update cron.sh
2024-12-04 07:29:11 +00:00
magical
6012f7757c
day 4 part 2
2024-12-04 07:27:10 +00:00
magical
5cb39af7b8
day 4 part 1
2024-12-04 06:19:26 +00:00
magical
1ea972f4f2
day 3
2024-12-03 06:09:30 +00:00
magical
d610807879
day 2
2024-12-02 05:23:17 +00:00
magical
a2143ba7ae
day 1 ivy solution
2024-12-02 03:56:40 +00:00
magical
f85cbb1539
day 1
2024-12-02 03:40:57 +00:00
magical
02ba7c97f9
initial commit
2024-12-02 01:22:03 +00:00
magical