.

Got this one ruined due to a post not masking
spoilers:

https://www.reddit.com/r/adventofcode/comments/1pkxibs/2025_day_25_part_1_still_pretty_clueless_why_its/

Basically, ignore the test case and just wing it by
asuming the 3x3 can be placed without overlaps. Id
the number of shapes * 3x3 is bigger than the available
canvas, it won't fit.

A naive first check to do before making premature
optimizations.

I would have gone the zip() hell route to prove
it actually works, but after grasping at the puzzle
input i realized it would tka a looong time to
calculate.

2025-python/output/day_10.py

@@ -0,0 +1,88 @@
+import re
+import functools
+from math import gcd, inf
+from pprint import pprint
+from collections import deque, Counter, defaultdict
+from heapq import heappop, heappush
+from itertools import compress, combinations, chain, permutations
+
+from output import matrix, D, DD, ADJ, ints, sints, mhd, mdbg, vdbg, cw, ccw, bk
+
+
+def solve(data):
+    r = r"^\[(.+)\] (.+) \{(.+)\}$"
+    p1 = 0
+    p2 = 0
+    for line in data.splitlines():
+        il, b, j = re.findall(r, line)[0]
+        B = [set(ints(s)) for s in b.split()]
+        E = set([i for i, s in enumerate(il) if s == "#"])
+        j = tuple(ints(j))
+
+        p = 0
+        L = set()
+        while L != E:
+            p += 1
+            for bp in combinations(B, p):
+                L = set()
+                for b in bp:
+                    L = L ^ b
+                    if L == E:
+                        break
+                if L == E:
+                    break
+        p1 += p
+
+        @functools.cache
+        def _press(T):
+            if not any(T):
+                return 0
+            L = set(i for i, s in enumerate(T) if s % 2 == 1)
+            R = inf
+            for p in [bb for ii, bb in enumerate(B) if ii in L]:
+                tt = list(T)
+                for b in p:
+                    for i in b:
+                        tt[i] -= 1
+                if any(j < 0 for j in tt):
+                    continue
+                Th = tuple(j // 2 for j in tt)
+                n = _press(Th)
+                if n is None:
+                    continue
+                R = min(R, len(p) + 2 * n)
+            return R
+
+        p2 = _press(j)
+
+    return p1, p2
+
+
+if __name__ == "__main__":
+    import os
+
+    # use dummy data
+    inp = """
+[.##.] (3) (1,3) (2) (2,3) (0,2) (0,1) {3,5,4,7}
+[...#.] (0,2,3,4) (2,3) (0,4) (0,1,2) (1,2,3,4) {7,5,12,7,2}
+[.###.#] (0,1,2,3,4) (0,3,4) (0,1,2,4,5) (1,2) {10,11,11,5,10,5}    """.strip()
+
+    # uncomment to instead use stdin
+    # import sys; inp = sys.stdin.read().strip()
+
+    # uncomment to use AoC provided puzzle input
+    with open("./input/10.txt", "r") as f:
+        in_p = f.read().strip()
+
+    # uncomment to do initial data processing shared by part 1-2
+    p1, p2 = solve(inp)
+
+    print(p1)
+    os.system(f"echo {p1} | wl-copy")
+    print(p2)
+    os.system(f"echo {p2} | wl-copy")
+
+    # uncomment and replace 0 with actual output to refactor code
+    # and ensure nonbreaking changes
+    # assert p1 == 466
+    # assert p2 == 17214

2025-python/output/day_11.py

@@ -0,0 +1,33 @@
+import functools
+from collections import defaultdict
+
+
+def solve(data):
+    G = defaultdict(set)
+    for line in data.splitlines():
+        f, *t = line.split()
+        G[f[:-1]] = set(t)
+
+    @functools.cache
+    def _traverse(k, fasttrack=True, fft=False, dac=False):
+        if k == "out":
+            return fasttrack or (fft and dac)
+        return sum(
+            _traverse(nk, fasttrack, fft or k == "fft", dac or k == "dac")
+            for nk in G[k]
+        )
+
+    return _traverse("you"), _traverse("svr", fasttrack=False)
+
+
+if __name__ == "__main__":
+    with open("./input/11.txt", "r") as f:
+        inp = f.read().strip()
+
+    p1, p2 = solve(inp)
+
+    print(p1)
+    print(p2)
+
+    assert p1 == 649
+    assert p2 == 458948453421420

2025-python/output/day_12.py

@@ -0,0 +1,26 @@
+from output import ints
+
+
+def solve(data):
+    p1 = 0
+    data = data.split("\n\n")
+    Q = data.pop().splitlines()
+    for q in Q:
+        W, H, *C = ints(q)
+        if W * H >= sum(C) * 9:
+            p1 += 1
+    p2 = "God jul!"
+    return p1, p2
+
+
+if __name__ == "__main__":
+    with open("./input/12.txt", "r") as f:
+        inp = f.read().strip()
+
+    p1, p2 = solve(inp)
+
+    print(p1)
+    print(p2)
+
+    assert p1 == 440
+    assert p2 == "God jul!"