2 Commits (d1a2b1eeb172c6e2af5040143d1e072e8a8f5537)

Author	SHA1	Message	Date
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