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
..
input	day 7	2024-12-07 05:43:17 +00:00
sample1.in	day 7	2024-12-07 05:43:17 +00:00
sol.py	day 7 optimization	2024-12-07 21:02:18 +00:00