Refactor 2023 for new system.

src/holt59/aoc/2023/day6.py

@@ -1,5 +1,7 @@
 import math
-import sys
+from typing import Any, Iterator
+
+from ..base import BaseSolver
 
 
 def extreme_times_to_beat(time: int, distance: int) -> tuple[int, int]:
@@ -25,23 +27,23 @@ def extreme_times_to_beat(time: int, distance: int) -> tuple[int, int]:
     return t1, t2
 
 
-lines = sys.stdin.read().splitlines()
+class Solver(BaseSolver):
+    def solve(self, input: str) -> Iterator[Any]:
+        lines = input.splitlines()
 
-# part 1
-times = list(map(int, lines[0].split()[1:]))
-distances = list(map(int, lines[1].split()[1:]))
-answer_1 = math.prod(
-    t2 - t1 + 1
-    for t1, t2 in (
-        extreme_times_to_beat(time, distance)
-        for time, distance in zip(times, distances)
-    )
-)
-print(f"answer 1 is {answer_1}")
+        # part 1
+        times = list(map(int, lines[0].split()[1:]))
+        distances = list(map(int, lines[1].split()[1:]))
+        yield math.prod(
+            t2 - t1 + 1
+            for t1, t2 in (
+                extreme_times_to_beat(time, distance)
+                for time, distance in zip(times, distances)
+            )
+        )
 
-# part 2
-time = int(lines[0].split(":")[1].strip().replace(" ", ""))
-distance = int(lines[1].split(":")[1].strip().replace(" ", ""))
-t1, t2 = extreme_times_to_beat(time, distance)
-answer_2 = t2 - t1 + 1
-print(f"answer 2 is {answer_2}")
+        # part 2
+        time = int(lines[0].split(":")[1].strip().replace(" ", ""))
+        distance = int(lines[1].split(":")[1].strip().replace(" ", ""))
+        t1, t2 = extreme_times_to_beat(time, distance)
+        yield t2 - t1 + 1