-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday13.py
62 lines (43 loc) · 1.47 KB
/
day13.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
import re
import sys
from dataclasses import dataclass, fields
from itertools import batched
from pathlib import Path
NUMBERS_RE = re.compile(r"\d")
@dataclass
class Machine:
a0: int
a1: int
b0: int
b1: int
r0: int
r1: int
def gauss(m: Machine) -> Machine:
if m.a1:
return Machine(m.a0, 0, m.b0, m.b1 * m.a0 - m.b0 * m.a1, m.r0, m.r1 * m.a0 - m.r0 * m.a1)
return m
def parse_machines(s: str) -> list[Machine]:
return [gauss(Machine(*xs)) for xs in batched((int(s) for s in re.findall(r"\d+", s)), n=6)]
def parse_machines_part2(s: str) -> list[Machine]:
return [gauss(tweak_machine(Machine(*xs))) for xs in batched((int(s) for s in re.findall(r"\d+", s)), n=6)]
def valid_buttons(m: Machine) -> None | tuple[int, int]:
assert m.a1 == 0
b, r = divmod(m.r1, m.b1)
if r == 0:
a, r = divmod((m.r0 - b * m.b0), m.a0)
if r == 0:
return a, b
def sum_of_solutions(ms: list[Machine]) -> int:
return sum(bs[0] * 3 + bs[1] for m in ms if (bs := valid_buttons(m)))
def main():
machines_part1 = parse_machines(Path(sys.argv[1]).read_text())
machines_part2 = parse_machines_part2(Path(sys.argv[1]).read_text())
print(f"Part 1: {sum_of_solutions(machines_part1)}")
print(f"Part 1: {sum_of_solutions(machines_part2)}")
def tweak_machine(m: Machine) -> Machine:
m = Machine(**m.__dict__)
m.r0 += 10000000000000
m.r1 += 10000000000000
return m
if __name__ == "__main__":
main()