2025: d02: ex2: add solution

2025/d02/ex1/ex1.py

@@ -0,0 +1,35 @@
+#!/usr/bin/env python
+
+import math
+import sys
+from collections.abc import Iterator
+
+
+def solve(input: str) -> int:
+    def parse_range(input: str) -> tuple[int, int]:
+        start, end = input.split("-")
+        return int(start), int(end)
+
+    def parse(input: str) -> list[tuple[int, int]]:
+        return [parse_range(r) for r in input.split(",")]
+
+    def iter_invalids(start: int, end: int) -> Iterator[int]:
+        for n in range(start, end):
+            digits = int(math.log10(n)) + 1
+            if digits % 2 == 1:
+                continue
+            base = 10 ** (digits // 2) + 1
+            if n % base == 0:
+                yield n
+
+    ranges = parse(input)
+    return sum(sum(iter_invalids(start, end + 1)) for start, end in ranges)
+
+
+def main() -> None:
+    input = sys.stdin.read()
+    print(solve(input))
+
+
+if __name__ == "__main__":
+    main()

2025/d02/ex1/input

@@ -0,0 +1 @@
+492410748-492568208,246-390,49-90,16-33,142410-276301,54304-107961,12792-24543,3434259704-3434457648,848156-886303,152-223,1303-1870,8400386-8519049,89742532-89811632,535853-567216,6608885-6724046,1985013826-1985207678,585591-731454,1-13,12067202-12233567,6533-10235,6259999-6321337,908315-972306,831-1296,406-824,769293-785465,3862-5652,26439-45395,95-136,747698990-747770821,984992-1022864,34-47,360832-469125,277865-333851,2281-3344,2841977-2953689,29330524-29523460

2025/d02/ex2/ex2.py

@@ -0,0 +1,41 @@
+#!/usr/bin/env python
+
+import math
+import sys
+from collections.abc import Iterator
+
+
+def solve(input: str) -> int:
+    def parse_range(input: str) -> tuple[int, int]:
+        start, end = input.split("-")
+        return int(start), int(end)
+
+    def parse(input: str) -> list[tuple[int, int]]:
+        return [parse_range(r) for r in input.split(",")]
+
+    def iter_invalids(start: int, end: int) -> Iterator[int]:
+        for n in range(start, end):
+            digits = int(math.log10(n)) + 1
+            for repeat in range(2, digits + 1):
+                if digits % repeat != 0:
+                    continue
+                mult = 10 ** (digits // repeat)
+                base = 0
+                for _ in range(repeat):
+                    base *= mult
+                    base += 1
+                if n % base == 0:
+                    yield n
+                    break  # Don't yield the same digit twice
+
+    ranges = parse(input)
+    return sum(sum(iter_invalids(start, end + 1)) for start, end in ranges)
+
+
+def main() -> None:
+    input = sys.stdin.read()
+    print(solve(input))
+
+
+if __name__ == "__main__":
+    main()

2025/d02/ex2/input

@@ -0,0 +1 @@
+492410748-492568208,246-390,49-90,16-33,142410-276301,54304-107961,12792-24543,3434259704-3434457648,848156-886303,152-223,1303-1870,8400386-8519049,89742532-89811632,535853-567216,6608885-6724046,1985013826-1985207678,585591-731454,1-13,12067202-12233567,6533-10235,6259999-6321337,908315-972306,831-1296,406-824,769293-785465,3862-5652,26439-45395,95-136,747698990-747770821,984992-1022864,34-47,360832-469125,277865-333851,2281-3344,2841977-2953689,29330524-29523460