solution: add 2015 day 25

Author: marcelblijleven

src/adventofcode/year_2015/day_25_2015.py

@@ -0,0 +1,54 @@
+from typing import List
+
+from adventofcode.util.exceptions import SolutionNotFoundException
+from adventofcode.util.helpers import solution_timer
+from adventofcode.util.input_helpers import get_input_for_day
+
+mul = 252533
+mod = 33554393
+
+
+def get_next_code(current_code: int, coords: tuple[int, int]) -> int:
+    x, y = 1, 1
+    want_x, want_y = coords
+
+    while True:
+        if y == 1:
+            y = x + 1
+            x = 1
+        else:
+            y -= 1
+            x += 1
+
+        current_code = (current_code * mul) % mod
+
+        if x == want_x and y == want_y:
+            return current_code
+
+
+@solution_timer(2015, 25, 1)
+def part_one(_: List[str]):
+    row = 2978
+    column = 3083
+    answer = get_next_code(20151125, (column, row))
+
+    if not answer:
+        raise SolutionNotFoundException(2015, 25, 1)
+
+    return answer
+
+
+@solution_timer(2015, 25, 2)
+def part_two(input_data: List[str]):
+    answer = 'hooray'
+
+    if not answer:
+        raise SolutionNotFoundException(2015, 25, 2)
+
+    return answer
+
+
+if __name__ == '__main__':
+    data = get_input_for_day(2015, 25)
+    part_one(data)
+    part_two(data)