feat: 2024 day 13

Author: Programator2

2024/13a.py

@@ -0,0 +1,43 @@
+from aoc import *
+import re
+from itertools import product
+
+
+def main(infi: str):
+    inp = filerstrip(infi)
+    machines = []
+    for machine in inp.split('\n\n'):
+        lines = machine.split('\n')
+        a = re.fullmatch(r'Button A: X\+(.*?), Y\+(.*?)', lines[0])
+        b = re.fullmatch(r'Button B: X\+(.*?), Y\+(.*?)', lines[1])
+        prize = re.fullmatch(r'Prize: X=(.*?), Y=(.*?)', lines[2])
+        machines.append(
+            (
+                (int(a[1]), int(a[2])),
+                (int(b[1]), int(b[2])),
+                (int(prize[1]), int(prize[2])),
+            )
+        )
+    tokens_needed = 0
+    INITIAL = 999999999999999999
+    for machine in machines:
+        tokens = INITIAL
+        for a, b in product(range(1, 101), range(1, 101)):
+            x = a * machine[0][0] + b * machine[1][0]
+            y = a * machine[0][1] + b * machine[1][1]
+            if (x, y) == machine[2]:
+                tokens = min(tokens, a * 3 + b * 1)
+        if tokens != INITIAL:
+            tokens_needed += tokens
+    return tokens_needed
+
+
+
+DAY = 13
+FILE_TEST = f"{DAY}_testa.txt"
+# FILE_TEST = f"{DAY}_testb.txt"
+FILE_EXP = f"{DAY}_exp.txt"
+FILE = f"{DAY}.txt"
+# test_and_submit(main, FILE_TEST, FILE_EXP, FILE, DAY)
+# print(main(FILE_TEST))
+print(main(FILE))

2024/13b.py

@@ -0,0 +1,46 @@
+from aoc import *
+import re
+from pprint import pprint as pp
+from sympy.solvers.solveset import linsolve
+from sympy import symbols, core
+
+
+def main(infi: str):
+    inp = filerstrip(infi)
+    tokens = 0
+    for machine in inp.split('\n\n'):
+        lines = machine.split('\n')
+        ax, ay = map(
+            int,
+            re.fullmatch(r'Button A: X\+(.*?), Y\+(.*?)', lines[0]).groups(),
+        )
+        bx, by = map(
+            int,
+            re.fullmatch(r'Button B: X\+(.*?), Y\+(.*?)', lines[1]).groups(),
+        )
+        px, py = map(
+            int, re.fullmatch(r'Prize: X=(.*?), Y=(.*?)', lines[2]).groups()
+        )
+        a, b = symbols('a, b', integer=True, positive=True)
+        system = (
+            ax * a + bx * b - px - 10000000000000,
+            ay * a + by * b - py - 10000000000000,
+        )
+        res = linsolve(system, a, b)
+        assert len(res) == 1
+        solution = next(iter(res))
+        if all(
+            type(sol) is core.numbers.Integer and sol > 0 for sol in solution
+        ):
+            tokens += 3 * solution[0] + solution[1]
+    return tokens
+
+
+DAY = 13
+FILE_TEST = f"{DAY}_testa.txt"
+# FILE_TEST = f"{DAY}_testb.txt"
+FILE_EXP = f"{DAY}_exp.txt"
+FILE = f"{DAY}.txt"
+# test_and_submit(main, FILE_TEST, FILE_EXP, FILE, DAY)
+# print(main(FILE_TEST))
+print(main(FILE))

README.org

@@ -4,6 +4,7 @@
 * Personal Stats 2024
 | Day |     Time | Rank | Score |     Time |  Rank | Score |
 |-----+----------+------+-------+----------+-------+-------|
+|  13 | 00:39:23 | 4308 |     0 | 12:34:52 | 21706 |     0 |
 |  12 | 00:43:21 | 4911 |     0 |     >24h | 27971 |     0 |
 |  11 | 00:16:43 | 4574 |     0 | 04:24:24 | 13605 |     0 |
 |  10 | 00:54:16 | 7416 |     0 | 00:56:37 |  6784 |     0 |

requirements.txt

@@ -1,2 +1,3 @@
-advent-of-code-data==2.0.4
-more-itertools==10.5.0
+advent-of-code-data==2.0.4
+more-itertools==10.5.0
+sympy==1.13.3