Andrew Ekstedt 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

day01

day 1 ivy solution

2024-12-02 03:56:40 +00:00

day02

day 2

2024-12-02 05:23:17 +00:00

day03

day 3

2024-12-03 06:09:30 +00:00

day04

day 4 part 2

2024-12-04 07:27:10 +00:00

day05

day 5 cleanup

2024-12-05 08:11:46 +00:00

day06

day 6 reduce state size

2024-12-06 05:51:15 +00:00

day07

day 7 optimization

2024-12-07 21:02:18 +00:00

.gitignore

ignore executables

2024-12-04 07:29:50 +00:00

cron.sh

update cron.sh

2024-12-04 07:29:11 +00:00

getinput.sh

initial commit

2024-12-02 01:22:03 +00:00

getsample.sh

initial commit

2024-12-02 01:22:03 +00:00

prelude.tcl

initial commit

2024-12-02 01:22:03 +00:00

Description

No description provided

227 KiB

Languages

Python 66.9%

C 21.5%

Tcl 5.8%

Shell 5.6%

Makefile 0.2%