Add solution to 2025-12-08

Author: fuglede

2025/day08/solutions.py

@@ -0,0 +1,25 @@
+from itertools import combinations
+from math import prod
+import networkx as nx
+
+with open("input") as f:
+    ls = f.read().strip().split("\n")
+
+
+ns = [tuple(map(int, l.split(","))) for l in ls]
+edges = sorted(
+    (sum((x1 - x2) ** 2 for x1, x2 in zip(n1, n2)), n1, n2)
+    for n1, n2 in combinations(ns, 2)
+)
+
+G = nx.Graph()
+G.add_nodes_from(ns)
+for i, (_, n1, n2) in enumerate(edges):
+    if i == 1000:
+        # Part 1
+        print(prod(sorted(map(len, nx.connected_components(G)))[-3:]))
+    G.add_edge(n1, n2)
+    if nx.is_connected(G):
+        # Part 2
+        print(n1[0] * n2[0])
+        break