Russell Champoux d8a67cf515 Add Day 12 solution (ft. an unused DLX library) ...

Turns out two simple heuristics solve the whole problem in 4ms:
1. Does the area fit? No → invalid
2. Are there enough 3x3 spaces for all presents? Yes → valid

But hey, at least we learned how to use Dancing Links for
a problem that didn't need it. The dlx crate thanks us for
the download stats.

2026-01-05 16:13:55 -05:00

..

.keep

Initial commit

2025-12-04 16:22:10 -05:00

01.txt

Solve Day 1: Secret Entrance

2025-12-04 17:04:14 -05:00

02.txt

Solve Day 2: Gift Shop

2025-12-04 17:11:46 -05:00

03.txt

Solve Day 3: Lobby

2025-12-04 17:19:18 -05:00

04.txt

Solve Day 4: Printing Department

2025-12-05 09:25:38 -05:00

05.txt

Solve Day 5: Cafeteria (fresh ingredient ranges)

2025-12-05 12:10:20 -05:00

06.txt

Solve Day 6 & 8, refactor Day 6 with itertools

2025-12-08 14:15:29 -05:00

07.txt

Solve Day 7: Tachyon beam splits and quantum timelines

2025-12-09 15:57:20 -05:00

08.txt

Solve Day 6 & 8, refactor Day 6 with itertools

2025-12-08 14:15:29 -05:00

09.txt

Add Day 10 and Day 11 solutions

2025-12-12 18:08:14 -05:00

10.txt

Add Day 10 and Day 11 solutions

2025-12-12 18:08:14 -05:00

11-2.txt

Add Day 10 and Day 11 solutions

2025-12-12 18:08:14 -05:00

11.txt

Add Day 10 and Day 11 solutions

2025-12-12 18:08:14 -05:00

12.txt

Add Day 12 solution (ft. an unused DLX library)

2026-01-05 16:13:55 -05:00