Refactor code for API (#3)

Co-authored-by: Mikael CAPELLE <mikael.capelle@thalesaleniaspace.com>
Co-authored-by: Mikaël Capelle <capelle.mikael@gmail.com>
Reviewed-on: #3

src/holt59/aoc/2023/day14.py

@@ -1,10 +1,9 @@
-import sys
-from typing import TypeAlias
+from typing import Any, Iterator, TypeAlias
+
+from ..base import BaseSolver
 
 RockGrid: TypeAlias = list[list[str]]
 
-rocks0 = [list(line) for line in sys.stdin.read().splitlines()]
-
 
 def slide_rocks_top(rocks: RockGrid) -> RockGrid:
     top = [0 if c == "." else 1 for c in rocks[0]]
@@ -34,35 +33,38 @@ def cycle(rocks: RockGrid) -> RockGrid:
     return rocks
 
 
-rocks = slide_rocks_top([[c for c in r] for r in rocks0])
+class Solver(BaseSolver):
+    def solve(self, input: str) -> Iterator[Any]:
+        rocks0 = [list(line) for line in input.splitlines()]
 
-# part 1
-answer_1 = sum(
-    (len(rocks) - i) * sum(1 for c in row if c == "O") for i, row in enumerate(rocks)
-)
-print(f"answer 1 is {answer_1}")
+        rocks = slide_rocks_top([[c for c in r] for r in rocks0])
 
-# part 2
-rocks = rocks0
+        # part 1
+        yield sum(
+            (len(rocks) - i) * sum(1 for c in row if c == "O")
+            for i, row in enumerate(rocks)
+        )
 
-N = 1000000000
-cycles: list[RockGrid] = []
-i_cycle: int = -1
-for i_cycle in range(N):
-    rocks = cycle(rocks)
+        # part 2
+        rocks = rocks0
 
-    if any(rocks == c for c in cycles):
-        break
+        N = 1000000000
+        cycles: list[RockGrid] = []
+        i_cycle: int = -1
+        for i_cycle in range(N):
+            rocks = cycle(rocks)
 
-    cycles.append([[c for c in r] for r in rocks])
+            if any(rocks == c for c in cycles):
+                break
 
-cycle_start = next(i for i in range(len(cycles)) if (rocks == cycles[i]))
-cycle_length = i_cycle - cycle_start
+            cycles.append([[c for c in r] for r in rocks])
 
-ci = cycle_start + (N - cycle_start) % cycle_length - 1
+        cycle_start = next(i for i in range(len(cycles)) if (rocks == cycles[i]))
+        cycle_length = i_cycle - cycle_start
 
-answer_2 = sum(
-    (len(rocks) - i) * sum(1 for c in row if c == "O")
-    for i, row in enumerate(cycles[ci])
-)
-print(f"answer 2 is {answer_2}")
+        ci = cycle_start + (N - cycle_start) % cycle_length - 1
+
+        yield sum(
+            (len(rocks) - i) * sum(1 for c in row if c == "O")
+            for i, row in enumerate(cycles[ci])
+        )