Compare commits
3 Commits
069788b2ee
...
4dc6fb41f3
| Author | SHA1 | Date | |
|---|---|---|---|
| 4dc6fb41f3 | |||
| 7ee762858c | |||
| 3775e36fad |
372
2020/input/2020/day18.txt
Normal file
372
2020/input/2020/day18.txt
Normal file
@ -0,0 +1,372 @@
|
||||
(7 * (3 + 8 + 8 + 7) + (6 + 8 * 2 + 5 + 2 * 6) * (5 + 2) * 9) + ((7 * 4 + 8) * 6 * 8 + 9) * 7 * 2 * 2
|
||||
6 * ((9 + 4) * (6 * 7 + 5 + 8 * 2))
|
||||
7 * 8 + 2 + 8 * (8 * 4) * (4 + 8)
|
||||
(9 + 3 + 2 * 5 * 8) + 9 + 5 * 2 * 5 * (6 * 6 * 4 + 6 * 9 * 3)
|
||||
6 * 6 * 4 * (6 + (3 * 9 * 2) + 9 + (4 + 7 + 7))
|
||||
7 * ((4 * 6 + 4 + 6 * 8 + 6) + (2 * 7 * 8 + 5 * 3 + 7) + (5 * 5 * 5 * 7) + 8 * 7)
|
||||
(8 + 9 * 7 * 9 + 6) + (7 + 5) + 6
|
||||
5 * (6 * (3 + 2 + 9)) + 8 + 3 + 5 * (4 + 3 * 8 * 8 * 6 * 2)
|
||||
4 + (3 + 4 * (4 + 9 + 3) * (4 * 8 * 4 * 9))
|
||||
4 * 4 * 6 * 2 + ((8 * 4 * 3 + 6) * 5) + 6
|
||||
(8 * (8 + 5 + 5 * 7) * 9 + 2 + 9) * 4 + 9 * ((3 + 3) + 8) + 9
|
||||
((9 + 8 * 3 + 2 + 9 + 8) * 3 + (3 + 7 * 6) * 9 * 2) + 3 * 7
|
||||
5 + 5 * (5 * (6 + 6 + 6 + 7) * 7 + (9 * 4) * 4 * (8 * 9))
|
||||
7 * (2 * 7 + 3 + 5 + 5 * 2) + 4 + 3 * 3 + 5
|
||||
(4 + 5 * (2 * 4 + 5 * 2 * 7 + 5) + 2 + 9) + 4 + 9 * 9 * 3
|
||||
7 * 6 + (6 * 2 + 4 + 5 * 8) + (6 * 2 * (4 * 7 * 2) + 9 * (5 * 2 * 4) + (3 + 2 * 5)) * 8
|
||||
2 + ((9 * 3 * 3 * 3) * (5 * 9 + 6 + 7 + 6 + 8) * 3)
|
||||
7 * ((9 + 7 + 4 * 3 * 4 + 4) + 4 * 3) * 5 * 3 * 7
|
||||
8 * (3 + 5 * 9 + 4) * 6 + 4
|
||||
7 + 6 * 7 * ((7 * 6 * 2) * 3) * 5 * 7
|
||||
8 + 5 * 4 * (3 + 5 * (8 + 5 * 2) + 6) + 6
|
||||
4 * 8 + ((3 * 5 * 4) + 7) + (4 * 2)
|
||||
((5 + 8 + 7 + 6 * 6 + 3) + 4 * 3 * (5 * 2) * 5 * (2 * 9)) + 6 + 3 * (2 * (2 + 4 + 8) * 4) + (9 + 3 + 6 * (9 + 5 * 6 * 3 * 8 * 5) + (4 * 6) + (6 * 3 + 2 + 8))
|
||||
(3 + 4 + 8) + 6 * (7 * 6 * (9 * 3 * 5 * 5 * 4 * 5) + (6 + 4) * (5 * 2 * 3 + 3) + (2 * 7)) + 2 * 4
|
||||
6 * (6 * 9 * (3 * 9) * 4 + 9) + 6
|
||||
4 + 6 * 7 * ((3 + 5 + 3) * (6 + 3 * 9 + 6 * 8 * 9) + 6 * 4) * 8
|
||||
5 + (6 + 9 * (7 * 8 * 8 * 3 * 4) + 2) * 4 * 2
|
||||
(2 * 7 * 6 + 9 + (3 * 6 + 4 * 7 + 5) + 8) + 7 + 7 * 8
|
||||
2 + (6 + 4 + (5 + 5) * 7) * 2 + 7 * 5
|
||||
4 + 9 * 3 + 8 * 6
|
||||
(5 + 5 + 9 * 8 * (4 * 5 + 6 + 3 * 8 * 3) + 6) + 9 + 9
|
||||
(8 * 4 * 7 + 9 + 6 * 9) * (9 + 2 * 2) + 3
|
||||
((9 * 4 + 8 + 4 * 2 + 2) * 3 + (6 + 9 * 5 * 4) * 4 + 6 * 5) * 5 * 3 * 5 + (3 + 5 * 4)
|
||||
5 + (5 * 3) * (2 + 8) * (3 + 6 + 4 * 6 + 7 + 7) * 5 * 7
|
||||
6 * 6 * 7 * (5 * 4 + 2 + 6 + (8 + 6 + 4 + 9 * 5))
|
||||
2 * 9 + (2 * (8 * 7 + 6 + 5 + 3) + 2 + 9 * (3 * 9 * 4 * 7 * 7 + 5) + 3) + (4 + 6 * 4 + 6)
|
||||
(9 + (8 * 8 + 2 + 2 * 6 + 6)) * 8 + 4 + 3 + (9 + 3 + 9 + 9 * 4 * 8) * 2
|
||||
8 * 4 * (4 * (3 + 7 * 7 + 3) + 8 * (5 + 2 + 3) * 2) + 9
|
||||
5 + (6 * (3 * 3 + 7 * 3) * (4 * 4) + 2 * 4 * 4)
|
||||
3 + (5 * 8 * 9 * 3 + 9 * (6 * 7)) * 9 + 3
|
||||
3 * (9 * 3 + (5 + 4 * 7 + 3 + 8)) + 4 * 2 * 3
|
||||
8 * 9 + 6 + (7 + 7 + 9 * 8 * 5 * 6) * 5
|
||||
(8 + 9 + 3 + 7 * 7) + 2 + 9 + (8 + 7 + 4 + 2) + 9
|
||||
4 * (2 * (7 * 4 + 2 + 9 + 6 + 7) + (4 + 2) * 3 + 9 + 6) + 6 * 4 + 7 * 5
|
||||
(3 * 4 + (5 * 8 * 2) * (7 + 8)) + 7 + 8 + 5 + ((6 * 9) * 4 * 5)
|
||||
4 + ((9 + 9) + (7 * 8 + 2 * 8 * 2) + 9) + 2 + 7 * 2
|
||||
8 * 3 * (9 + 5 + 8 + 5)
|
||||
4 + 4 + (6 + 2 * 7 + 9 + 6 * 5)
|
||||
((8 + 3 * 8 * 2) + 7 + 7 * (7 * 7 * 7 + 3) * 9 * (9 * 4 + 7)) + 4 + 6
|
||||
6 + (7 * 2 + 4 + 5 + 4) + 9 + ((7 * 9) * 7) * 5
|
||||
(7 * 3 * 2) * ((9 + 6 * 2 * 6 * 3) + (6 * 7) + 3 + (6 + 5 * 5 + 4 + 9 * 6) * 4 + 9) + 4 + 7 + 6
|
||||
9 * (3 * (9 + 8)) * 4
|
||||
6 * (4 * 2 * (9 * 5 * 4 + 7 + 9) + 6 + (3 + 6 * 2)) * 5 * (3 * (2 + 6 * 8 * 6 + 3 + 7) * 8 * 7 * (9 * 8 * 7 + 7 + 9) * 7) + 3 + 6
|
||||
7 + 3 * ((6 * 3 * 9) + 3 * 9)
|
||||
7 * ((4 + 4 * 4 * 9 * 7) + 2 * 9) * 8 * 6 * 6 + 3
|
||||
6 + 5 + (5 + 3 * (3 + 7 + 9 * 3) * 6) + 3 + ((2 * 3 * 4 + 4) * 6 + (3 + 3) + 2)
|
||||
9 + ((8 * 9 * 3 * 2) * 5 + 8)
|
||||
(2 + 7) * 3 * (8 + 5) + 9
|
||||
4 * (5 + 4 + 6 * (9 * 4 + 8 * 4 * 7 * 3) * (4 * 4 * 6) * (9 + 7 + 8 * 4)) * (4 + 4 + 9 + 8) + 7 * 8 + 5
|
||||
((7 * 4 * 4 * 3) * 4 + 2 * 2 + 2) * 9 + 9 * 8 + 9
|
||||
4 + 6 + 2 * (5 + 3 + 8 * 4)
|
||||
((7 + 6) + 3 * 3 * 5) * ((9 * 3 + 5 + 8) + (3 + 8 * 8 + 7 + 5 * 6) + 2 * 5 + (7 + 9 + 2)) + (4 * 2 * (5 + 8 + 5 + 3) * 5 + 6 * 2) + 6 * 5 * (2 * (9 + 4) * (7 * 8) * 8 + 7)
|
||||
6 + 5 + 5 + 2 * 5
|
||||
5 + 5 + 8 * 8 + 2 + 6
|
||||
(3 * (4 * 6 * 8 * 2)) + 3
|
||||
(5 + 6 * 3 + 5 * 2) * 5 * (3 * 5 + 2 * 7 * 9 * 3) + 5 * ((6 + 2 * 7 + 2 + 4 + 2) * 9 + 6) + 7
|
||||
(7 + 7 * 4 * 7) * ((8 * 5 * 9) + 6 * 9 + 3 * 3 * 9) * 8 * ((3 * 5 * 2 + 6 + 5) * 7 + (6 * 2 * 7 * 7) + 8 + 8 + 6)
|
||||
(3 * 6 + 7 + 6 + 3 + 7) * 4 * 7 * ((9 + 3 + 6) * 5 + 3 + (5 * 7 + 4 + 5 * 2) + 5) * 5 * 9
|
||||
7 * ((7 + 6 + 2 + 9) + 3 * 4 + 9 + 2 + 2) + 2
|
||||
3 * 8 * 2 * (6 * 2 * 2 + 4 * 8) + 8 + 7
|
||||
8 + 3 + ((4 * 6 * 5 * 7) * 9 + 9 + 8 * 4)
|
||||
(6 + 4 + (6 + 3 + 3 + 3) + 6) * 9
|
||||
2 * 6 * (5 + 2) * (6 * 6 + 7 + 2)
|
||||
4 + (8 + 2 + 4) * 4 * 5 + (9 * 5 + 9) + 8
|
||||
6 * 3 * 9 + 6 + (2 * 4 * 3 + 2 * 5 * 3) * 6
|
||||
2 + (8 + 5 * 7 + 4 + 7 * (2 + 9 * 6 * 5 * 3 + 3)) + 9 * 4
|
||||
(9 + (2 + 6 + 7 * 4 * 8) + 9 * 4 + 9) * 3 + 8 * 8
|
||||
2 * (9 * 5 * 9 + (8 * 9 + 5)) * 8 * 8
|
||||
3 + 6 + 2 * 3 * 9 + 9
|
||||
8 * 7 + 8 * (5 + 6) * 5 + 4
|
||||
4 * (6 * 2 * (3 + 6 * 3) + 7 * 5 + 6)
|
||||
(7 * 3 * 7 * 4 * 3 * 2) * (9 + 8 * 9) + 9 * (4 * 5 + 3 + 5 + 9)
|
||||
9 + 8 * 3 * 4 + (9 + 8 * 9) + (4 * (6 * 4 * 9 * 5 + 6 + 4) + 8 + 7 + (4 * 9))
|
||||
2 * (4 * (3 + 4 + 8 + 5) * 8 * 6)
|
||||
8 * (8 * 2 * 6 + 6 + 6) * 8
|
||||
(9 + 3 * 4 * 9 + 5 * 5) * 4
|
||||
(9 * 9 * 4 * 4 + (6 * 2) + (3 + 3 * 2)) + 3 + ((2 * 3 + 8 * 4 * 8 * 2) + 2 + 3)
|
||||
7 * (9 * (6 + 3 + 7)) * ((8 + 3 + 3 * 3 + 3 + 7) + 4 + 5 + 3 * (6 * 4 * 6 * 6 + 2 * 5) + (2 + 3 + 9 + 3 * 6 + 4)) + 6
|
||||
8 + 6 * (3 + 5 + 6 + 9) * 4
|
||||
(6 + 7 + 7 + 7 * 6 + 5) + 3 * 5 * 4 * 5 * 6
|
||||
(2 * 9 + 9 + 3 * 7 + 6) + 3 + 7 + 4 + 9
|
||||
(7 + (8 * 7 * 4 * 7 * 2 + 4) + (5 + 2 * 2 + 2 * 2 * 6)) * 3 * 4 + (4 * 2 + 4 * 6 + 3 * (8 * 6 + 4 * 3 * 7)) * 6
|
||||
2 * (3 * (5 * 7 * 8 * 7 + 8) + (6 * 3 + 5) + 5 + 9)
|
||||
8 * 4 + ((7 + 2 + 8) + (2 * 8 * 4 * 4 + 4 * 7) * 2) * 5 * 4
|
||||
2 * 6 * 2
|
||||
2 + (2 + 6 * 5 * 9) + ((8 + 2 * 6 * 5 * 5) * 7 + 3) + 3
|
||||
((9 + 4 + 6 * 3 + 9) * 5) * (7 * 2 * 7 * 5 * 2) + 7 + 9 + 7
|
||||
2 + 2 * 8 + 8
|
||||
4 + 6 + 4 * 7
|
||||
4 + 5 + 5 * 8 * (8 + 4 + (2 * 8 + 9 * 9 + 4 + 5))
|
||||
(7 + 2 + (8 * 4 * 2 + 9 * 6) * 4) * 2 + (9 * 2 * 8 * 9 * 4)
|
||||
4 + 9 + 6 * (4 * 6) + 7
|
||||
6 + 4 + 8 * (7 * 9 + 7)
|
||||
3 * 2 + 2 + 9 + (2 * 9 * 2 * 8 * 2 * (2 + 8 + 9 * 9 + 7)) * 7
|
||||
9 + 9 + 5
|
||||
(2 + 3 * 3) + 7
|
||||
(9 * 7 + (8 + 8 * 6) + 2 * 7 * 3) + 6 * (5 * (2 + 9 + 9 + 6) + 6) * 8 * (4 + 4 * 6 * 5 + 5) * 8
|
||||
7 + 4 + (4 * 2 + (2 * 7 + 2 + 4 + 2 + 5) + 9 * (9 * 7 + 7)) + 9 + 7 + (8 + 9 * 7 + 2 + (7 * 8 * 5 * 4 + 6 + 8))
|
||||
(8 * 3) * (9 + 2 * 7 * 7 + 7) * 6 * 8 + 8 + (9 + 9 + 3 * 5 + 3)
|
||||
4 * 5 + 2 + 4
|
||||
((7 + 3 * 8 + 3) * 8 + 4 + 4 * 4 + 8) * 5 + 9 * (3 * 9 + 8 * 7 * 9 * 4) + 7
|
||||
(8 + 6 + 7 + 9) + 8 * 6 * (5 + 2 + 3) * 8
|
||||
(9 * 8 * (6 * 5) + 9) + 4 + 8 + 8 * 8
|
||||
(4 + 5 * 9) * 7 + 7 * 6 + 8 * (2 + 5 * 8)
|
||||
(4 + 3 + (6 + 2 + 2 + 6 * 6 * 2) * 4 * 2 * 9) + 3
|
||||
8 * (5 + 8 + 2 * 7) + 2 + ((5 * 6 + 4 + 7 + 6 * 5) * 7 * 3 + 8)
|
||||
2 + 5 + (6 * 3 + 2) + 8
|
||||
2 + 9 * 6 * 5 + 5
|
||||
3 * 3 + 7
|
||||
(9 + 4 * 9) + 5 + (2 * 6 * (6 + 9) + 2 + 6) * 2 * ((9 * 6 + 7 * 3) + 5 * 2 + 3 * 9)
|
||||
2 + 6 + ((6 * 9 * 9 * 8 * 9) + 9) * (5 + 2 * 5 * (3 + 5 * 8 * 5 * 2 * 9) * 8) * ((7 + 9 + 3 + 6 + 5) * 4 * 5)
|
||||
3 * 9 * (5 + (3 * 4 * 2 + 8) + 5 * 3) + 4
|
||||
9 * (9 * 3 + 3 + 4 + 7 + 4) + 3
|
||||
2 * 9 + 3 * 9 + 5 + 9
|
||||
(6 + (6 * 6 * 6 + 7 + 7 + 5) * 5) + 3 + 4 * 9
|
||||
(2 * 8 * 8 * 6 * 8) + (5 + (5 * 6) * (8 + 5 + 7 * 7 + 2) + (6 * 4 + 7 + 5) + (3 + 5 + 8 + 6)) * 8 + ((8 * 3 + 3 * 7) * 4 + (3 * 8 * 4))
|
||||
4 + ((9 * 2 * 9 * 9 * 7 + 5) * 6) * 7 * 7 + 5 * 8
|
||||
(3 * 6 + 6 * (5 + 6 * 4 * 6 + 2 + 9)) * 9 * 9 + (2 * 7 * 2 * 5)
|
||||
6 + 2 + (8 + 6)
|
||||
6 + 3 * (3 + 3) + 8 * (9 * 6)
|
||||
(2 * 8 + 4 + 5) + 7
|
||||
7 + (2 * 9 * 5 * 6)
|
||||
2 + 9 + ((7 + 3 + 3 * 9) * 6 + (5 + 2 + 8 + 5 * 6) * 7 + 8)
|
||||
((4 + 9 + 8 * 6 + 8 * 9) + 8) * 6
|
||||
9 * (9 * 3 + (3 * 8 * 8 * 7) * (4 + 8) + 8 * (5 * 3 + 2 + 4 * 3))
|
||||
9 * (7 + (3 * 5 * 5 + 3 * 7)) + (5 * 3 + (4 * 7 * 7 + 8) * (3 * 7 * 5 * 6) * 8) * 5 + (2 * 7) * 4
|
||||
4 * ((2 + 3 * 2 * 2 + 3) + 4 * 4 * 4 * 5 + (3 + 3 * 9 * 9 + 7)) * 9
|
||||
8 + 7 * 4 * 3 * (5 + 9 + 8 * 7 * 3)
|
||||
9 + (4 * (2 * 6 + 7) + 5 * 4 + 8 + (6 + 7 * 8 * 2)) + 9 + 5 + 8
|
||||
3 * ((5 * 2 * 8 * 7 * 2 + 4) * (3 * 3 * 5 + 2) + 7 + 8) * 8 * 2 + 3
|
||||
(8 * 2 + 5 + (4 * 9 * 7)) * 5 + (9 * 8) * (5 * (7 * 8 + 4 * 4) + 3)
|
||||
((7 * 6 + 9 + 7 + 9 + 9) * 2 * 8 + (6 + 4 * 7 * 2 * 2) * 7 + (2 + 9 + 9 + 5 + 4)) * 5 * 2 + 7
|
||||
7 + 2
|
||||
4 * ((2 * 6) * 5 * 5 + 9 * (7 * 7 * 3 + 8)) + 2
|
||||
6 * 8 + 5 + 4 * (5 + 8)
|
||||
4 + 6 * (4 * 5 * 3 * 5 * 5 * 6) * 8 * 5
|
||||
7 + ((6 * 6 + 2) + 7 * 7 + 7 * 9 * 6) + 6
|
||||
(7 + 3 * (2 * 5 + 3 * 9)) + 2 * 2
|
||||
6 + 3
|
||||
2 * 8 * (3 + 8 * (4 + 6 * 4) * 8 * 2)
|
||||
8 * ((4 + 8 * 5 + 7) + 6 + (4 + 8 + 4 + 9 * 7 + 9) + 2) + 5
|
||||
(7 + 7 + 2 + 3 + 6 * 3) * ((7 + 5 + 8 + 5 * 6) + 4 + 6 * (3 + 3) * (4 + 6 * 9 * 6 + 4) * 7) * 3 * 9 + 5 + 4
|
||||
5 * 7 * (5 * (2 + 5 * 7 + 7 * 5) + 9) + 3
|
||||
8 + 2 * 4 * 3 + (8 + 3 + 4 + 3 + 2 * (4 * 5)) * 5
|
||||
3 + (8 * 3) * 7 + 4 * 5 * 2
|
||||
(7 * (7 * 2 * 7 * 3) * 3 + 2 + 7 * 6) * 4 * 6 + 6 + 6
|
||||
(5 + 2 + 2 * 8 + (2 * 9 + 7 + 3) + 5) * 9
|
||||
(6 + (7 + 8 * 2 + 9) + (7 * 3 * 4 * 5) + 6 * 3 * 4) + (3 * 2 * 5)
|
||||
4 + 7 + (8 * 7 + (5 * 4))
|
||||
8 * 2 * 5 * (9 + 4) + (3 * 7)
|
||||
(3 + 4 + 8 + 6 + 2) * 9 + 6 + 6 + 3
|
||||
(9 + (3 * 4 * 5 * 8 + 5) + (5 + 8)) + 5 * ((2 + 5) + (7 + 9) * 2) * (6 * 3) + 8
|
||||
9 * (3 + 9 + 8 * (9 + 7 + 9 + 8 * 6) + 8 * 8) + 2
|
||||
7 * ((9 * 2 + 8 * 4 + 7) * 4 + 3 + (5 * 3 * 5 + 3 + 4)) * 5 * 7
|
||||
5 + 2 + (8 * 8) + 8
|
||||
4 * (4 * 9 + (7 * 6 + 2 * 2 + 5 + 8) * 9 + 7) * 3 * 7
|
||||
9 + 9 + (4 * (8 + 2 * 5 * 9 + 9 * 2) * 4 * 7) + (6 + 2) * ((8 * 7) + 9 * (7 + 7 * 7) + 2 + 5 + 2) + 6
|
||||
9 + 4 + (3 * 9 * 3 * 9) + (3 + (2 + 9 + 9 + 8 + 7) + 5 + 9 * 3) * 7 * (4 + 7 * 8 + 7 * (4 * 2 + 5 * 8 + 9 + 8) + 3)
|
||||
6 + (2 + 6) * (6 * 2 * 2 + 7) * 4 * 6
|
||||
6 * (2 + (6 * 7 + 7 * 9) * 6) * 3 * 8 + 3
|
||||
8 + (5 + 4 + 6)
|
||||
9 + 2 * (5 * 5 * 5) * 2 * 5
|
||||
4 * 4 * ((3 * 3) * (9 + 7 + 5) + 5 + 9) + 7 * (4 * 2 * 4) * 7
|
||||
((4 * 5 * 7 * 7 + 3) * 9) * (6 * (7 * 8 * 7 + 3 + 7) + (4 * 2 + 3 + 3) * 4 + 6)
|
||||
4 * 2 + 3 + 2 * (2 + 2 * 2 * 8)
|
||||
4 + ((3 + 8) * 7 + 2 + (9 + 4 + 9 + 3 + 4 + 6) * (7 * 5 + 8)) + 4 + 5 * 8 + 2
|
||||
(5 * 2) + 3 + (3 + 9) + 4 + 4 * 5
|
||||
6 + (5 + 8 + 6 + (7 + 5 + 9)) + (3 * 5 + 8 * 3 * 4) * 4 + 4 + 5
|
||||
((7 + 4 * 6) * 7 * 2 + 6) * 7 + 8
|
||||
7 * 5
|
||||
2 + 9 * 4 + 9 + 4 + (8 * 9)
|
||||
5 + 5 * ((5 + 6) + 2 * 4) * (8 + 8 * 5) + 3
|
||||
5 * 5
|
||||
4 * 3 * 4 + 3 * (7 * 9) + 4
|
||||
4 + 4 * (8 * 3 + 2 * 8 + 2) + 4 + 3
|
||||
(8 + 5 + 4 * 4 + 6 * 9) + 8 * 6 * 3
|
||||
8 + 6 + 3 + ((2 * 9 + 2) + (7 + 7 + 3)) + 6
|
||||
(4 + 5 + 8) * 8 + (7 * 9 + 3 * 3 + 9 + (8 + 5 + 7 + 3 + 9)) + (3 * 3) * 8
|
||||
(4 + 4 + 4 * 6 + 4 + 9) * 6 * ((8 + 6 + 3 + 2 * 8 + 2) * 4 + 6 * 8 * 7) * 5
|
||||
6 * 6 + 3 * (2 + 7 + 3) * 4 + 5
|
||||
((2 * 4 + 3 * 3 * 9 * 3) * 7) + 2 + 8 + 6 * 2
|
||||
5 * (5 * 4) + 6
|
||||
((7 + 6) + 7) + 3 * 2 * 9 * 6 + 4
|
||||
6 + 8 + ((4 * 9 + 5) * 4) * (5 + 7 + 8 * 8 * 2) + 9
|
||||
8 * 4 * 8 * 9 * 2
|
||||
5 + 2 + (8 + 9 * 6 * 7 * 6) * 8
|
||||
6 * (9 * 5) + (5 + 2 + 6 * 8) * 6 * 6 * (4 + 7 + 8 * 8)
|
||||
2 * 3 * 6 * 8
|
||||
3 + (4 + 5 * 8 * 8) * 2 * (9 * (5 * 3 + 8 + 6) * 2 + (5 * 7 * 3) * (4 + 5) + 7)
|
||||
6 * (5 * 4) * 5 + 4 + (6 + 2) + 6
|
||||
2 * (4 * (7 + 2 + 3 + 3 * 8) * (9 + 3 * 3) + (6 * 8 * 5 * 7) + (6 + 5) + 7) * (3 + 8 + (5 + 4 + 8 + 6) * 3 + 2 + 3) * 8 + (3 * 3) * 9
|
||||
(5 + (4 * 8 * 7) + 7 * (7 * 9 + 2 + 5 + 6)) + 4
|
||||
6 + ((3 + 9) * 4)
|
||||
9 + ((4 + 4 + 5 * 6) * 8) * 2
|
||||
(4 + 2) * 3 * 3 + 3
|
||||
5 + 2 + (8 + 7 + 5)
|
||||
6 + (7 + 4 * 9 * (6 + 8 * 8 + 3) * 8)
|
||||
3 + 3 * 6 * 3 + (4 * (2 + 6 * 7) * 8)
|
||||
7 * 5 + 8 * 7 + (9 + 4 * (7 + 6 + 2 * 7 * 9) + 9 + 9 * 4) + (3 + 6 + 5 * 6 * 4 + 9)
|
||||
5 + (9 * (5 * 7 * 6 * 8) + (8 * 3) * 6 + (2 + 7 * 8)) * (9 + (5 + 7 * 2 * 6 + 9 + 7) + 4 + 8 * 3) * 7
|
||||
(6 + 7 * 7 * 9 * 4) * 3 + (5 + 7) * 7 * 5 * 6
|
||||
(9 + 6 * 5 + 3) * (2 + 6 + 6) + 4 * 6 + 3
|
||||
5 + 8 + ((9 + 8) * (3 * 3 + 8 * 8) * 2 + 3) * 6 * 4
|
||||
((3 + 9 * 2 * 8 * 7) * 7 * 8 + 3 + 7) * (8 * 9) * 5
|
||||
5 + 3 + (4 * 4 * (8 * 8 + 4 * 4) + 4 + 5 * 6) * 4 + 2 + 7
|
||||
5 + ((6 + 4 + 9 + 3) * 6 + (2 + 4 * 9 + 4 + 7 + 7)) + 4 + 9 * 8
|
||||
2 + 4 * 7 * 5 * ((5 + 4 + 6) + 4 * 4)
|
||||
8 * 6 + (4 + 8 * 5 * 6 + 4 * 9) * 9 + (2 + 8)
|
||||
((8 + 3 * 2 * 6) * (7 + 8 * 8) * 9 + (2 + 5) + 4) * (2 * 9 * 5 + (9 * 4 * 2 + 7 + 8) * 2 + 2) * 6
|
||||
4 * ((5 * 5 + 6 * 8 * 5 * 9) + 4 * (3 + 7 * 6 + 4) * 4) + 2 * ((9 + 8 + 9) + 9 * 2) * 8 + 4
|
||||
2 * 8 * 6
|
||||
(7 + (7 + 8 * 9) * 7 + (5 * 8 * 6 * 9 + 6 * 4)) + ((5 + 9 * 6 + 7) + 8 + 7 + (8 * 7 * 4 + 5 + 2) * 5 + (9 + 3 + 9 * 2 * 6 * 3)) * (4 + 5 * 4) + (8 * (5 * 5) * 9 * (3 * 3) + 5) * 4
|
||||
(6 + 5 + 5 * 5) * 4 + ((8 + 6 + 8) + 5 + 5 + 7 * 9)
|
||||
9 * (9 * 2 + 4 * 2 * 4)
|
||||
4 + (6 + 2) * (4 + 2 + 2 * 5) + 2
|
||||
5 * (6 + 8 + 5 * 2 * (7 * 2 + 2))
|
||||
((7 + 5) * 2 * (3 * 5 * 9)) + 7 * (7 * 5 + 9 * 9 * (5 * 9))
|
||||
7 + 5 * (2 * 3 * 4 + 9 * 7 * 9) + (2 + 8 + (3 * 6) * 7 * 7 * (5 * 8 * 7 + 8 * 6 * 9)) * 5
|
||||
9 * 3 * ((9 + 7) * 7 * (2 * 9 + 5 * 9 * 7 + 8) + 6 * 6 + 6) * (9 + 7 + 6 + 9 * 7)
|
||||
8 + 9 * 4 * ((7 * 3 + 6 + 6 * 7 + 9) + 8 * 5 * 2)
|
||||
3 * (3 * (5 + 5 + 5 * 2))
|
||||
4 * 4 * 8 * 6 + (3 + (5 + 5 + 5 + 6 * 6) * 8 * 9 + 9) + 3
|
||||
(3 + 8) + 4
|
||||
6 + 5 + 3 + ((2 + 5 + 6) + (9 + 5 * 4 * 9) + 6 * 7 + 5)
|
||||
(6 * 8 * (2 + 2 + 8 + 8 + 2) + 7 + 6 * 3) + ((7 * 3 * 9) + 2 * 4 * 4 + 2) + 5
|
||||
6 * ((6 * 8 + 3 * 9) + 2 * 9) + 3 * (6 + (3 * 7 * 4) + 4 * (6 * 8 * 3 * 7 + 3 * 8) * 6 * 7) * 6
|
||||
5 * 8 * (7 * 7 + 4 * 7) + (2 * 4 + (3 * 2 * 4 * 9) + 4 + 2)
|
||||
(3 * 8) + 3 + 6 + (3 * 3 + 9 * 6 * 8) + 3 + 5
|
||||
((6 + 5 + 7 + 3) * 7 + 9 * 5) + 9 + 2
|
||||
3 + 2 * ((9 + 9) * 8 + 5 * (6 + 4 * 6) + 4 + 7) + 9 + 4 * 4
|
||||
5 * 6 + (5 + 6 * 8 * 5 * (8 * 2 + 7) * (7 * 6 * 2 * 2 * 7 * 6))
|
||||
8 + 4 + 3 + (4 * 7) * 2 * (2 + (3 + 8 + 8 * 2 * 9))
|
||||
7 + 5 + 3 + ((9 * 9 + 2 * 8 * 6 + 5) * 2) + (3 * 7 + 6 * 4 * (8 * 6 + 8 + 8 + 7 * 3) + (9 + 3 * 8 * 6 + 4)) * (9 * 6 * 9 * 6)
|
||||
5 + (2 + (6 * 3 * 3 + 9 * 8 * 8) + 3) + 9 * 6 + 6
|
||||
6 + (2 + (3 * 5 + 2 + 4)) + 7 * 9 * (8 * 9 * 6)
|
||||
((4 * 4) + 2 + 7 + (5 + 3 * 2 + 9 + 8 + 4) * 5) * (2 * (6 + 8 * 9 + 7) * 9 + (7 + 5 * 7) * 8) + 6 * 3 * 3
|
||||
(7 * 5) * (5 + 3 + 5)
|
||||
(2 * 6 * 9 + 9 + 6) + 9 * 8
|
||||
6 + (9 + 6 + 7 * 7 * 3 + (9 + 8 + 2 * 3 + 4 + 7)) + 9 * ((2 * 5 + 4 * 6 * 6 * 7) + (6 + 5 * 4 * 5 * 8) + 9) + ((5 + 7) * 5 * 4)
|
||||
(7 * 2 + 7 * 8 * (7 + 6)) * 2 * 2 * 2
|
||||
(6 + 5 * 2 + 3 + 5) * 8 + 4 + 2
|
||||
3 + 4 + 3 + 7 * ((2 * 8 * 8 * 3 + 4 + 4) * 8 * 2 * 9 + 4 + 9)
|
||||
7 + (5 * (7 * 9 + 7 + 2 * 7) + 9 + 3 + 5 + (8 * 9))
|
||||
8 * (2 * (8 + 4 * 3) + 7 * 7 + 5 + 8) + 3 + 6 * 8
|
||||
(8 + 3 * 5) * 6 + 2
|
||||
3 + 8 * ((3 * 8) + 8 + 5)
|
||||
5 * 9 * 5 + ((5 + 6 + 7) + 4) + ((5 + 8 + 3 + 4 + 3) * 8 * 3)
|
||||
7 * (6 + 4 + (7 + 4 + 4 + 6) * 3 * 3 + 2) + 7 + 8 + 4 + 3
|
||||
2 + ((3 + 8) + 2 + 9 + 4 * 3)
|
||||
4 + 9 * 3 + 9
|
||||
(7 + (7 * 4 + 7) * (6 * 6 * 9 * 4) * (2 + 5 + 8 + 3)) * 3
|
||||
(8 + 2 + 4 * 7 * 3) + 2 * ((6 + 2 + 2) + 7 * 8 * 8 * 5 * 8) + 7 + (5 + 8 + 2 * (9 * 9) + 3)
|
||||
8 * 2 + 6 * ((5 * 3) * 6 * 2 * (7 * 2 + 4 * 4 + 9)) + 4
|
||||
4 * 3 * (8 + 7 * (2 + 4 + 7 + 4 + 3)) * 9
|
||||
7 + (6 + (6 + 2) + 8 + 9 + 3) * (3 + 9 * (3 + 5 + 6 + 7 + 6) + (8 * 8 * 7) + 5 + 8) * 9 * 2 * 8
|
||||
3 + 6 * (3 * 5) * (9 + 4 * 3) + (5 * 6 + 3) * 6
|
||||
6 + (5 * 6 * 7 * (2 * 4) * 9) * 7 * 7 * 6 * ((2 * 6 * 2 + 3) + 7 + 9 * 2 + 6 * 6)
|
||||
(4 * 4 * 2) * (4 + 3)
|
||||
7 * 8 * 9 * 6 * 2 + (8 * (8 + 6 + 6) + 3 + 5 + 2)
|
||||
(9 + 2 + (8 * 9 * 5 + 7) + 3) * 9 * (7 + 8 + 3 * 4 + 5) + 8 * (5 * 5 + (4 + 5 + 5 * 3 + 8) * 4) + (7 + 3 + 7 + 4)
|
||||
8 * (2 * 2 + (8 + 7 * 9 * 2) * (8 * 2 + 5 + 4) * 9 + 8) * 6 + 3 + (4 * 3) * 7
|
||||
(5 + 7 + 9 * 6 + 4) * 9
|
||||
(3 + (5 + 3 + 4) * 3) + 3 + 8 * ((5 * 8 * 6) + (8 + 6 * 4 * 4 + 8) * 8 + 2 * 4 + 7) + (2 * (5 * 5 * 3) * 2 * 9)
|
||||
(8 + 2 * 8) + 9 * 8 + 7
|
||||
4 * (2 * 3 + 8 + 3 * 5) * ((3 * 3 * 8 + 7) * (7 + 5 + 8) * 6) + (9 * 5) + 8
|
||||
7 * (6 * 3) + (7 + 8 + (2 + 5) * 3) + 7 + 6
|
||||
5 + 9 * 2
|
||||
9 * 2 + 8 * (3 * (6 * 7 * 7) * 8) + 9
|
||||
((2 + 8 + 7 + 6) + 4 * (6 * 5 + 7 * 4 + 5) * 8) * 9 + (7 + 2 * 5 * 5 * 3 * 3) + 3
|
||||
6 + 3 * 3 + (8 + 4)
|
||||
(8 + (8 * 2) + 4) * 5 * 4 + 5
|
||||
(5 * 5 * 5 * 8 + 8 + 7) + (6 + 9) + 4 * 3 + 4
|
||||
(3 + (2 * 9 + 2 + 9 + 4) + 2 + (5 + 3 + 2)) * 5 * 3 + 5
|
||||
6 + 3 * ((8 + 7 * 8 * 7 + 9) + 3 + 3 + 9 * (7 + 5 + 9) * 9) + 5 + (7 * 8 + (5 * 7 + 5 * 9 + 4))
|
||||
(4 * 9) + 7 * 9
|
||||
(3 + 7) + 2 + (5 * 2 * 4 * 6 + 5)
|
||||
5 * 4 * 2 * ((9 * 4 * 7) * 2 * 3) + 3 + 6
|
||||
(5 + 2 * 7 * 7) * (4 * (3 * 8 * 2) * 3 * (2 + 3 * 8)) + 4 * 6 + 8 + 7
|
||||
7 * 4 + 2 + (6 + 2 * 5 * 2 + 6 * 9) + 7 * 2
|
||||
8 + (4 * 4 * 7 * 9 + 5 + 6)
|
||||
(4 + 7 + 8 * 6) + (3 * 5 + 4) + 4
|
||||
6 + 2 + 3 + 2 * 3 + 9
|
||||
6 + ((7 * 6 + 5) + 4 + 9 + (5 + 6 * 6 + 5 * 2 * 9) * (2 * 9)) + 9 + 5 * 2
|
||||
8 + 3 * 4 * 3 * (3 * 9 * 2)
|
||||
9 * (7 * 7 * 4) + 3 + (9 + (6 + 6 + 2 + 3 + 5 + 6) * (3 * 7 * 9 * 3) * 6 + 8 * 3)
|
||||
5 * (9 * 2 + (6 + 2 * 5) + 5)
|
||||
4 + 3 + 9 + 7 + 5 + (3 * (2 + 8 * 6) * 4 + 2)
|
||||
3 * ((2 + 5 + 2 + 6) + 3 + 4 + (7 + 9) * (7 + 8 * 4 + 9) * 3) + 9 + (8 + 6)
|
||||
8 + 4 * 4 + 7 + ((3 * 9 * 2 + 2 * 8) + (3 + 6 + 2 * 5 * 4 * 8) * 8 * 8)
|
||||
4 + 4 * ((5 + 3 + 2 * 4 + 7 * 8) * (5 * 6 + 9) + 5 * 3)
|
||||
7 * 8
|
||||
3 + (5 * 3 + (5 * 9) * 2 + 4) + 2 + 3
|
||||
6 + 8 + 3 + (2 * (6 + 5 + 3 * 8 + 9) * 3 * 9) * (6 * 8)
|
||||
2 * 9 * 4 * (6 * 2 * 6 * 3 * 8) * 4
|
||||
6 + (3 * 4 * 7 + 5 * 5 + 2) * 4 + (6 * 5 * (6 + 2 + 9 + 6 * 8) * 2 + 5) + 4
|
||||
6 * ((6 + 4) + 9 * 5 * 3 + (9 * 5)) * (4 + 2 * 7 * (4 * 9 * 3 * 8) * 4) + 3
|
||||
7 * 2 + 6 * (3 * 6 + 6 * 5) * 7 * 7
|
||||
3 + 8 * (3 * 2 + (9 * 3 + 8 * 7 + 8 + 4) + 6 + 3 + 5) + (6 + 8 + 7 * 3) * 9 * (4 * 3 * 6 + (9 + 9 * 9 * 2 * 6) + 4 + (6 * 4 + 5 + 9 + 9 + 7))
|
||||
4 * 8 * (8 * 5 + 3 * 6 * 7 + 9) * 9
|
||||
8 + 4 * 9 * 4 * 8
|
||||
(3 * 7 + (5 * 2 + 7 + 5 * 6) + 9 * 5) * 6 + 6 + 2 * 5
|
||||
(8 + (4 * 8 * 8) * 7) + 4 * 8 * ((4 * 4 * 5) + 8 + 8 + 2) + ((6 * 8) * 8 * 8 * 8 * 2) + 8
|
||||
4 * (6 + 2 + 6 + 9 + 7) * 4 + 7 + 9
|
||||
5 + (2 + 6 * 8 + 5) + (6 + (8 + 9 + 5) * 4 * 3) * 4 * 5
|
||||
9 * 6 + 5 * (4 + 2 + (7 + 9 * 6)) + 5 + 6
|
||||
8 + ((8 + 3 + 5 + 3 * 8) + 5 + 3) * 4 * 3
|
||||
2 + (3 + 5 * (8 * 2) + 8 + 5) * 8 + 4 + (8 + (9 + 8) + 8 * 9 * 7) + 9
|
||||
7 * (4 * 2 + 5) * 8
|
||||
3 + 5 + 7 + (6 + 2 * 7 * 7 * 5) + ((3 * 4 + 8 * 5 + 6) + 4 * 5)
|
||||
(9 + 6) * 7 * (9 + 3 + 4 * (8 + 8 * 3 + 6 + 8 * 2))
|
||||
2 + (6 + 5 + (7 * 5 + 5 + 9 + 7 + 6) + 2 + 2 * (8 + 8))
|
||||
4 * 9 + 2 * 9 + 9 + 8
|
||||
((2 * 7 * 5) * 8) * 8 + 4 + 8 * 4
|
||||
7 * 5 + (8 + 9) * 3 * 6
|
||||
8 + ((9 + 7 + 8) + (8 * 5) + 2 + 7 + 3 + 3) + 3
|
||||
6 * (5 * (7 + 6 + 5 * 9 + 8 * 5) * 6) + 7 * 9 * ((2 + 5 * 8 * 2 + 3) * 3 + 7 + 5 * 3) * 2
|
||||
3 * (3 + 5 + 4) * 6 * 9
|
||||
6 + ((8 * 5 + 3 + 9) * (5 + 2 * 4 * 5 + 5) + (2 * 3) + 4 + 7) + 7 + 8 * 6 + 4
|
||||
((9 * 2 + 8 * 9) * 4 + 5 * 3 * (8 * 2 * 7)) + (7 + 4 * 2 + 6) * 9
|
||||
(6 * 5 + 7 * (5 * 5 + 4 + 7 * 7 + 6) + 2) * ((4 + 6 * 5 * 6 + 7) + 9 + 5) * 7 * (4 + 7 * 6 + 5) * 5
|
||||
8 * (3 * 6 + 5) + 9 * (9 + 6 * (4 * 6) + (7 + 8 + 5 + 3)) * (3 * 7 * 8 * 2) + 9
|
||||
8 * 3 + (5 + 3) + 8 * 4 + (4 + (7 + 9 * 5 * 3) * 6 + (7 + 5 + 4) + 8 * 8)
|
||||
2 * 3 + ((8 * 8 * 8 + 4) * 7 * 7) * 5 * 8
|
||||
(6 * (7 + 3 + 8 * 5 + 2) + 2 * 4 + 5 * 5) * 2 * (8 + 3 + 3 + (6 + 4) * (9 * 3)) + 6 * 9
|
||||
8 * (7 * 6 * 8 * (3 * 6 + 4 + 6 + 2 + 2) * 6) + 8 * 8 * 6
|
||||
(7 * 5 * 5) * 7 * ((3 + 6 + 3 + 4 + 2 * 2) * 8 * (7 + 9 * 9 * 9))
|
||||
((5 + 7 * 9 * 2 + 7) + 7 + 5 * 6 + 3) * 6 * 2 * 3
|
||||
5 + (5 * (9 + 9) + (7 * 7 * 4 + 2) * 3)
|
||||
((8 * 8 + 2 + 8 * 9) * 5) + (2 + (9 * 6 + 9 + 7) * 7)
|
||||
3 + ((7 * 4 * 4 * 5) * (8 + 3 * 4 + 4 * 9) * 5 * 3 + 7) + 4 * 2 * 7 * (3 * 6 * 6)
|
||||
((9 * 7 + 6 + 7 * 9 + 2) * 4 + 3 + 4 + 4 * 6) * 8 + (4 + (8 + 2 * 6 * 4 * 3)) + (5 + 2 * 6 * (4 * 5 + 4 + 2)) + 4 * (6 + 3 * (2 * 2 * 6 * 3) + 8 + 4 * 5)
|
||||
(5 * (7 + 9 + 5) + 6) * 5 * (6 + 7 * 9 + 6) * 9 * 5 + 9
|
||||
(4 * 4 * 6 * (5 * 8 + 3 + 8) + 5) + (9 * (3 * 9 + 3 * 9) + 5 + 8 + 2 * 3) * 3 * 2 + 8 * 5
|
||||
7 + 5 * (3 + 8 + 6 * 9 + 5 * 8) * ((9 * 9 * 4 * 9 + 3) * (6 + 9 * 5) * 8 + 4 + 6)
|
||||
7 + 8 * ((3 + 7 * 5) + 3 * 2 + 2 * 3 + 7) * 9 + 8 * 7
|
||||
3 + 4 + (5 * (9 + 9 + 3 * 6 * 4 * 3) * 4) * (4 * (7 * 6 * 3 + 5 * 2 * 9) + (7 * 3 + 5))
|
||||
3 * (2 + 8 + 2) * 6 * (4 * 4)
|
||||
2 + 2 + 3 * 5 + (3 + (6 + 2) + 9 + 7) * (3 * 3 + 5 + 8 + 7)
|
||||
4 + 5 + 6 * 6 * 6 + (3 * 2 * 3 * (2 * 6 + 9) + 6 + (5 + 2 + 9 * 6))
|
||||
((4 + 9) + 2) * 7 + 3 * 4
|
||||
2 + 6 * ((2 * 7 * 8 * 3 + 8 + 4) + 9 + 6 + 9 * 2 + 9) + 7 * 6
|
||||
9 * 7 + ((2 + 5 * 2 * 7 * 8) + 6 * 2 + 3 + 4) * 5 * (5 + 2 * 7) * 8
|
||||
4 * (8 + 5 * 6 * 8) + 2 + 3 * 7
|
||||
(2 * 2) * 9 * 6 * 3 + 9
|
||||
9 + 2 * (7 + 5 + 7 + (3 + 7 * 2 * 2 + 3) * 3)
|
||||
(2 + 5 * 9) * (4 * (9 + 2 * 4 + 3 + 2) * 2 + 8 + (6 * 7 + 9 + 5)) * 3 + 8
|
||||
(6 * (6 + 7 * 7) + 7 * 6 * 7) + ((7 * 6 * 4) * 6 * (8 + 8 + 5 * 7 * 8 + 8) + (4 + 5 * 5 + 5 + 3 * 9) + 8)
|
||||
9 * (6 * 9 * (8 * 2 * 6) + 4 * 4)
|
||||
(5 + 5 * 5 + 8) * 6 + 5 * 2
|
||||
4 + ((8 + 7) + 5) + 6
|
||||
9 + 6 * (7 + 4 + (9 + 4 + 2 + 8)) + (8 * 5)
|
||||
(3 * 8 + (6 + 9 * 8 + 6)) + 3 + 4 * 8 + 5 * 3
|
||||
3 + 6 * (7 * 8 * 6 * (5 + 8 + 6) + 5 * 4) * ((8 + 9 + 6 * 8) * 9 + 6 * 6 + 2 * 2) * 4
|
||||
7 * (6 * (5 * 5 + 9 * 7 + 5 + 9) + 8 + 9 + 2 * (6 * 7 * 7)) * 3
|
||||
4 + 2 * (5 * (3 * 8 * 3) * (5 + 9 + 8 * 9) + 9 + 7) * 7 + 5
|
||||
6 * 5 * (5 * 3 * 9 * 4 * 2) * 9 + 7 * 4
|
||||
3 * (4 * (7 + 2) + 4 + 6 + (3 + 6 + 6 * 5)) + 5
|
||||
7 * 7 * (5 + 9 + 9) * (8 * 6 * 5 + 4 * 2)
|
||||
6 + (9 * 4) * ((4 * 2 * 4 * 4 * 6 * 7) + 9 + (2 * 9 + 9 + 9)) + 2 + 4 + 4
|
||||
9 * (6 * 5 + 9 * 2 * 4) + 7 + 8 * 8 + 9
|
||||
(6 + 7 + 8 * 2 * 4) * 5 + 2 + 2 * 5 + 6
|
||||
8 * 7 * (9 * 2 * 4 + 3 + 4 * 4) + (8 * 8 + 9 + 6) + ((7 * 7 + 2 * 9) * (2 * 8 + 2) * 6 * 6) + 8
|
||||
339
2020/src/day18.rs
Normal file
339
2020/src/day18.rs
Normal file
@ -0,0 +1,339 @@
|
||||
//! --- Day 18: Operation Order ---
|
||||
//! As you look out the window and notice a heavily-forested continent slowly appear over the horizon, you are interrupted by the child sitting next to you. They're curious if you could help them with their math homework.
|
||||
//!
|
||||
//! Unfortunately, it seems like this "math" follows different rules than you remember.
|
||||
//!
|
||||
//! The homework (your puzzle input) consists of a series of expressions that consist of addition (+), multiplication (*), and parentheses ((...)). Just like normal math, parentheses indicate that the expression inside must be evaluated before it can be used by the surrounding expression. Addition still finds the sum of the numbers on both sides of the operator, and multiplication still finds the product.
|
||||
//!
|
||||
//! However, the rules of operator precedence have changed. Rather than evaluating multiplication before addition, the operators have the same precedence, and are evaluated left-to-right regardless of the order in which they appear.
|
||||
//!
|
||||
//! For example, the steps to evaluate the expression 1 + 2 * 3 + 4 * 5 + 6 are as follows:
|
||||
//!
|
||||
//! 1 + 2 * 3 + 4 * 5 + 6
|
||||
//! 3 * 3 + 4 * 5 + 6
|
||||
//! 9 + 4 * 5 + 6
|
||||
//! 13 * 5 + 6
|
||||
//! 65 + 6
|
||||
//! 71
|
||||
//! Parentheses can override this order; for example, here is what happens if parentheses are added to form 1 + (2 * 3) + (4 * (5 + 6)):
|
||||
//!
|
||||
//! 1 + (2 * 3) + (4 * (5 + 6))
|
||||
//! 1 + 6 + (4 * (5 + 6))
|
||||
//! 7 + (4 * (5 + 6))
|
||||
//! 7 + (4 * 11 )
|
||||
//! 7 + 44
|
||||
//! 51
|
||||
//! Here are a few more examples:
|
||||
//!
|
||||
//! 2 * 3 + (4 * 5) becomes 26.
|
||||
//! 5 + (8 * 3 + 9 + 3 * 4 * 3) becomes 437.
|
||||
//! 5 * 9 * (7 * 3 * 3 + 9 * 3 + (8 + 6 * 4)) becomes 12240.
|
||||
//! ((2 + 4 * 9) * (6 + 9 * 8 + 6) + 6) + 2 + 4 * 2 becomes 13632.
|
||||
//! Before you can help with the homework, you need to understand it yourself. Evaluate the expression on each line of the homework; what is the sum of the resulting values?
|
||||
|
||||
use aoc_runner_derive::{aoc, aoc_generator};
|
||||
|
||||
#[derive(Clone, Copy, Debug, PartialEq)]
|
||||
enum Token {
|
||||
Num(u32),
|
||||
Add,
|
||||
Mul,
|
||||
Open,
|
||||
Close,
|
||||
Space,
|
||||
}
|
||||
|
||||
#[derive(Debug, PartialEq)]
|
||||
enum Ast {
|
||||
Add(Box<Ast>, Box<Ast>),
|
||||
Mul(Box<Ast>, Box<Ast>),
|
||||
Num(u32),
|
||||
}
|
||||
|
||||
fn eval(ast: &Ast) -> u32 {
|
||||
0
|
||||
}
|
||||
|
||||
#[derive(Copy, Clone, Default, PartialEq)]
|
||||
struct NodeId(usize);
|
||||
impl fmt::Debug for NodeId {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
write!(f, "NodeId({})", self.0)
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Default)]
|
||||
struct Node {
|
||||
parent: Option<NodeId>,
|
||||
data: Option<Token>,
|
||||
left: Option<NodeId>,
|
||||
right: Option<NodeId>,
|
||||
}
|
||||
|
||||
impl Node {
|
||||
fn set_left_child(&mut self, id: Option<NodeId>) -> Option<NodeId> {
|
||||
let old = self.left;
|
||||
self.left = id;
|
||||
old
|
||||
}
|
||||
fn set_right_child(&mut self, id: Option<NodeId>) -> Option<NodeId> {
|
||||
let old = self.right;
|
||||
self.right = id;
|
||||
old
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug)]
|
||||
struct Tree {
|
||||
nodes: Vec<Node>,
|
||||
root: NodeId,
|
||||
}
|
||||
|
||||
use std::fmt;
|
||||
impl fmt::Display for Tree {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
fn print_node(f: &mut fmt::Formatter<'_>, tree: &Tree, id: NodeId) -> fmt::Result {
|
||||
//dbg!(id, tree.get_node(id));
|
||||
match tree.get_node(id).data {
|
||||
None => (),
|
||||
Some(Token::Num(n)) => write!(f, "{}", n)?,
|
||||
Some(Token::Add) => {
|
||||
print_node(f, tree, tree.get_node(id).left.unwrap())?;
|
||||
write!(f, "+",)?;
|
||||
print_node(f, tree, tree.get_node(id).right.unwrap())?;
|
||||
}
|
||||
Some(Token::Mul) => {
|
||||
print_node(f, tree, tree.get_node(id).left.unwrap())?;
|
||||
write!(f, "*",)?;
|
||||
print_node(f, tree, tree.get_node(id).right.unwrap())?;
|
||||
}
|
||||
Some(Token::Open) => {
|
||||
write!(f, "(",)?;
|
||||
}
|
||||
Some(Token::Close) => {
|
||||
write!(f, ")",)?;
|
||||
}
|
||||
Some(Token::Space) => {
|
||||
write!(f, " ",)?;
|
||||
}
|
||||
};
|
||||
Ok(())
|
||||
}
|
||||
print_node(f, self, self.root)
|
||||
}
|
||||
}
|
||||
impl Default for Tree {
|
||||
fn default() -> Tree {
|
||||
Tree {
|
||||
nodes: vec![Node::default()],
|
||||
root: NodeId(0),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl Tree {
|
||||
fn get_node(&self, id: NodeId) -> &Node {
|
||||
&self.nodes[id.0]
|
||||
}
|
||||
fn get_node_mut(&mut self, id: NodeId) -> &mut Node {
|
||||
&mut self.nodes[id.0]
|
||||
}
|
||||
fn add_node(&mut self, n: Node) -> NodeId {
|
||||
self.nodes.push(n);
|
||||
NodeId(self.nodes.len() - 1)
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Default)]
|
||||
struct Parser {
|
||||
tree: Tree,
|
||||
cur: NodeId,
|
||||
debug_tokens: Vec<Token>,
|
||||
}
|
||||
|
||||
impl Parser {
|
||||
fn add_left_child_cur(&mut self, mut n: Node) -> NodeId {
|
||||
n.parent = Some(self.cur);
|
||||
let id = self.tree.add_node(n);
|
||||
self.cur_node_mut().left = Some(id);
|
||||
id
|
||||
}
|
||||
fn add_right_child_cur(&mut self, mut n: Node) -> NodeId {
|
||||
n.parent = Some(self.cur);
|
||||
let id = self.tree.add_node(n);
|
||||
self.cur_node_mut().right = Some(id);
|
||||
id
|
||||
}
|
||||
fn cur_node_mut(&mut self) -> &mut Node {
|
||||
self.tree.get_node_mut(self.cur)
|
||||
}
|
||||
|
||||
fn cur_node(&self) -> &Node {
|
||||
self.tree.get_node(self.cur)
|
||||
}
|
||||
fn set_cur_data(&mut self, t: &Token) {
|
||||
let cur = self.cur_node();
|
||||
let cur_id = self.cur;
|
||||
if cur.data.is_some() {
|
||||
match cur.right {
|
||||
Some(node) => {
|
||||
// Create a new node, stick it in `right` and reparent the previous node.
|
||||
let id = self.tree.add_node(Node {
|
||||
parent: Some(self.cur),
|
||||
..Node::default()
|
||||
});
|
||||
self.set_cur_node(id);
|
||||
self.tree.get_node_mut(cur_id).right = Some(id);
|
||||
self.cur_node_mut().left = Some(node);
|
||||
}
|
||||
None => {
|
||||
let id = self.add_right_child_cur(Node::default());
|
||||
self.set_cur_node(id);
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
self.cur_node_mut().data = Some(*t);
|
||||
}
|
||||
fn set_cur_node(&mut self, id: NodeId) {
|
||||
assert_ne!(Some(self.cur), self.cur_node().parent);
|
||||
self.cur = id;
|
||||
}
|
||||
fn set_cur_to_parent(&mut self) {
|
||||
match self.cur_node().parent {
|
||||
Some(parent) => self.set_cur_node(parent),
|
||||
None => {
|
||||
let id = self.tree.add_node(Node::default());
|
||||
self.cur_node_mut().parent = Some(id);
|
||||
let old_id = self.cur;
|
||||
self.tree.root = id;
|
||||
|
||||
self.set_cur_node(id);
|
||||
self.cur_node_mut().left = Some(old_id);
|
||||
}
|
||||
}
|
||||
}
|
||||
fn add_token(&mut self, t: &Token) {
|
||||
//TODO(wathiede): we seem to be building the tree backwards so that walking the tree works
|
||||
// right-to-left instead of left-to-right.
|
||||
self.debug_tokens.push(*t);
|
||||
match t {
|
||||
Token::Num(_) => {
|
||||
self.set_cur_data(t);
|
||||
self.set_cur_to_parent();
|
||||
}
|
||||
Token::Add => {
|
||||
self.set_cur_data(t);
|
||||
let id = self.add_right_child_cur(Node::default());
|
||||
self.cur = id;
|
||||
}
|
||||
Token::Mul => {
|
||||
//dbg!(&self);
|
||||
self.set_cur_data(t);
|
||||
let id = self.add_right_child_cur(Node::default());
|
||||
self.cur = id;
|
||||
}
|
||||
Token::Open => {
|
||||
let id = self.add_left_child_cur(Node::default());
|
||||
self.cur = id;
|
||||
}
|
||||
Token::Close => self.set_cur_to_parent(),
|
||||
Token::Space => unreachable!("spaces should be filtered"),
|
||||
};
|
||||
}
|
||||
fn eval(&self) -> u32 {
|
||||
dbg!(&self.debug_tokens);
|
||||
dbg!(format!("{}", self.tree));
|
||||
fn eval_inner(tree: &Tree, id: NodeId) -> u32 {
|
||||
match tree.get_node(id).data {
|
||||
None => panic!("empty node"),
|
||||
Some(Token::Num(n)) => n,
|
||||
Some(Token::Add) => {
|
||||
let l = eval_inner(tree, tree.get_node(id).left.unwrap());
|
||||
let r = eval_inner(tree, tree.get_node(id).right.unwrap());
|
||||
dbg!(l, r);
|
||||
dbg!(l + r)
|
||||
}
|
||||
Some(Token::Mul) => {
|
||||
let l = eval_inner(tree, tree.get_node(id).left.unwrap());
|
||||
let r = eval_inner(tree, tree.get_node(id).right.unwrap());
|
||||
dbg!(l, r);
|
||||
dbg!(l * r)
|
||||
}
|
||||
Some(Token::Open) => panic!("("),
|
||||
Some(Token::Close) => panic!(")"),
|
||||
Some(Token::Space) => panic!(" "),
|
||||
}
|
||||
}
|
||||
eval_inner(&self.tree, self.tree.root)
|
||||
}
|
||||
}
|
||||
|
||||
#[aoc_generator(day18)]
|
||||
fn generator(input: &str) -> Vec<Vec<Token>> {
|
||||
input.split('\n').map(lex).collect()
|
||||
}
|
||||
|
||||
fn lex(input: &str) -> Vec<Token> {
|
||||
input
|
||||
.bytes()
|
||||
.map(|b| match b {
|
||||
b'(' => Token::Open,
|
||||
b')' => Token::Close,
|
||||
b'+' => Token::Add,
|
||||
b'*' => Token::Mul,
|
||||
b' ' => Token::Space,
|
||||
c @ b'0'..=b'9' => Token::Num((c - b'0') as u32),
|
||||
c => panic!(format!("unexpected char '{:?}'", c)),
|
||||
})
|
||||
// Ignore spaces
|
||||
.filter(|t| t != &Token::Space)
|
||||
.collect()
|
||||
}
|
||||
|
||||
fn parse(tokens: &[Token]) -> u32 {
|
||||
let mut p = Parser::default();
|
||||
dbg!(&p);
|
||||
tokens.into_iter().for_each(|t| p.add_token(t));
|
||||
p.eval()
|
||||
}
|
||||
|
||||
#[aoc(day18, part1)]
|
||||
fn solution1(tokens_list: &[Vec<Token>]) -> u32 {
|
||||
tokens_list.iter().map(|tokens| parse(tokens)).sum()
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use super::*;
|
||||
|
||||
#[test]
|
||||
fn test_lex() {
|
||||
let tokens = vec![
|
||||
Token::Num(2),
|
||||
Token::Mul,
|
||||
Token::Num(3),
|
||||
Token::Add,
|
||||
Token::Open,
|
||||
Token::Num(4),
|
||||
Token::Mul,
|
||||
Token::Num(5),
|
||||
Token::Close,
|
||||
];
|
||||
assert_eq!(lex("2 * 3 + (4 * 5)"), tokens);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn part1() {
|
||||
for (input, want) in vec![
|
||||
("1 + 2 * 3 + 4 * 5 + 6", 71),
|
||||
("2 * 3 + (4 * 5)", 26),
|
||||
("5 + (8 * 3 + 9 + 3 * 4 * 3)", 437),
|
||||
("5 * 9 * (7 * 3 * 3 + 9 * 3 + (8 + 6 * 4))", 12240),
|
||||
("((2 + 4 * 9) * (6 + 9 * 8 + 6) + 6) + 2 + 4 * 2", 13632),
|
||||
] {
|
||||
dbg!(&input);
|
||||
assert_eq!(parse(&lex(input)), want, "{}", input);
|
||||
}
|
||||
}
|
||||
}
|
||||
245
2020/src/day19.rs
Normal file
245
2020/src/day19.rs
Normal file
@ -0,0 +1,245 @@
|
||||
//! --- Day 19: Monster Messages ---
|
||||
//! You land in an airport surrounded by dense forest. As you walk to your high-speed train, the Elves at the Mythical Information Bureau contact you again. They think their satellite has collected an image of a sea monster! Unfortunately, the connection to the satellite is having problems, and many of the messages sent back from the satellite have been corrupted.
|
||||
//!
|
||||
//! They sent you a list of the rules valid messages should obey and a list of received messages they've collected so far (your puzzle input).
|
||||
//!
|
||||
//! The rules for valid messages (the top part of your puzzle input) are numbered and build upon each other. For example:
|
||||
//!
|
||||
//! 0: 1 2
|
||||
//! 1: "a"
|
||||
//! 2: 1 3 | 3 1
|
||||
//! 3: "b"
|
||||
//! Some rules, like 3: "b", simply match a single character (in this case, b).
|
||||
//!
|
||||
//! The remaining rules list the sub-rules that must be followed; for example, the rule 0: 1 2 means that to match rule 0, the text being checked must match rule 1, and the text after the part that matched rule 1 must then match rule 2.
|
||||
//!
|
||||
//! Some of the rules have multiple lists of sub-rules separated by a pipe (|). This means that at least one list of sub-rules must match. (The ones that match might be different each time the rule is encountered.) For example, the rule 2: 1 3 | 3 1 means that to match rule 2, the text being checked must match rule 1 followed by rule 3 or it must match rule 3 followed by rule 1.
|
||||
//!
|
||||
//! Fortunately, there are no loops in the rules, so the list of possible matches will be finite. Since rule 1 matches a and rule 3 matches b, rule 2 matches either ab or ba. Therefore, rule 0 matches aab or aba.
|
||||
//!
|
||||
//! Here's a more interesting example:
|
||||
//!
|
||||
//! 0: 4 1 5
|
||||
//! 1: 2 3 | 3 2
|
||||
//! 2: 4 4 | 5 5
|
||||
//! 3: 4 5 | 5 4
|
||||
//! 4: "a"
|
||||
//! 5: "b"
|
||||
//! Here, because rule 4 matches a and rule 5 matches b, rule 2 matches two letters that are the same (aa or bb), and rule 3 matches two letters that are different (ab or ba).
|
||||
//!
|
||||
//! Since rule 1 matches rules 2 and 3 once each in either order, it must match two pairs of letters, one pair with matching letters and one pair with different letters. This leaves eight possibilities: aaab, aaba, bbab, bbba, abaa, abbb, baaa, or babb.
|
||||
//!
|
||||
//! Rule 0, therefore, matches a (rule 4), then any of the eight options from rule 1, then b (rule 5): aaaabb, aaabab, abbabb, abbbab, aabaab, aabbbb, abaaab, or ababbb.
|
||||
//!
|
||||
//! The received messages (the bottom part of your puzzle input) need to be checked against the rules so you can determine which are valid and which are corrupted. Including the rules and the messages together, this might look like:
|
||||
//!
|
||||
//! 0: 4 1 5
|
||||
//! 1: 2 3 | 3 2
|
||||
//! 2: 4 4 | 5 5
|
||||
//! 3: 4 5 | 5 4
|
||||
//! 4: "a"
|
||||
//! 5: "b"
|
||||
//!
|
||||
//! ababbb
|
||||
//! bababa
|
||||
//! abbbab
|
||||
//! aaabbb
|
||||
//! aaaabbb
|
||||
//! Your goal is to determine the number of messages that completely match rule 0. In the above example, ababbb and abbbab match, but bababa, aaabbb, and aaaabbb do not, producing the answer 2. The whole message must match all of rule 0; there can't be extra unmatched characters in the message. (For example, aaaabbb might appear to match rule 0 above, but it has an extra unmatched b on the end.)
|
||||
//!
|
||||
//! How many messages completely match rule 0?
|
||||
use std::collections::HashMap;
|
||||
use std::fmt;
|
||||
|
||||
use aoc_runner_derive::{aoc, aoc_generator};
|
||||
use regex::Regex;
|
||||
|
||||
#[derive(Debug)]
|
||||
struct Input {
|
||||
rules: Regex,
|
||||
messages: Vec<String>,
|
||||
}
|
||||
|
||||
impl PartialEq for Input {
|
||||
fn eq(&self, other: &Self) -> bool {
|
||||
self.rules.as_str() == other.rules.as_str() && self.messages == other.messages
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Clone, Eq, PartialEq, Hash)]
|
||||
enum Entry {
|
||||
Rule(usize),
|
||||
Char(String),
|
||||
}
|
||||
impl fmt::Debug for Entry {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
match self {
|
||||
Entry::Rule(n) => write!(f, "Entry({})", n)?,
|
||||
Entry::Char(c) => write!(f, r#"Entry("{}")"#, c)?,
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
}
|
||||
|
||||
struct Resolver {
|
||||
rule_map: HashMap<usize, Vec<Vec<Entry>>>,
|
||||
resolved: HashMap<Entry, String>,
|
||||
}
|
||||
|
||||
impl Resolver {
|
||||
fn resolve(&mut self, e: &Entry) -> String {
|
||||
if let Some(v) = self.resolved.get(e) {
|
||||
return v.to_string();
|
||||
}
|
||||
|
||||
match e {
|
||||
Entry::Char(s) => {
|
||||
self.resolved.insert(e.clone(), s.to_string());
|
||||
s.to_string()
|
||||
}
|
||||
Entry::Rule(n) => {
|
||||
let subrules: Vec<String> = self.rule_map[n]
|
||||
// TODO(wathiede): clone here seems inefficient, but it made the borrow checker
|
||||
// happy given the &mut recursive call to self.resolve in the map closure.
|
||||
.clone()
|
||||
.iter()
|
||||
.map(|rule| {
|
||||
let letters: Vec<_> = rule.iter().map(|e| self.resolve(e)).collect();
|
||||
letters.join("")
|
||||
})
|
||||
.collect();
|
||||
let s = subrules.join("|");
|
||||
|
||||
if subrules.len() > 1 {
|
||||
// More than one rule,
|
||||
return format!("({})", s);
|
||||
}
|
||||
s
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fn expand_rulemap(rule_map: HashMap<usize, Vec<Vec<Entry>>>) -> Regex {
|
||||
let mut r = Resolver {
|
||||
rule_map,
|
||||
resolved: HashMap::new(),
|
||||
};
|
||||
let rule_zero = r.rule_map[&0][0].clone();
|
||||
let re = rule_zero
|
||||
.iter()
|
||||
.fold("".to_string(), |acc, e| format!("{}{}", acc, r.resolve(e)));
|
||||
|
||||
Regex::new(&format!(r"^{}$", re)).unwrap()
|
||||
}
|
||||
|
||||
fn make_rules(lines: Vec<String>) -> Regex {
|
||||
let mut rules = HashMap::new();
|
||||
|
||||
lines.iter().for_each(|l| {
|
||||
let idx = l.find(':').expect("missing ':'");
|
||||
let k: usize = l[..idx].parse().expect("failed to parse number");
|
||||
|
||||
let sub: Vec<Vec<Entry>> = l[idx + 2..]
|
||||
.split(" | ")
|
||||
.map(|sub| {
|
||||
sub.split(' ')
|
||||
.map(|p| match p.parse() {
|
||||
Ok(n) => Entry::Rule(n),
|
||||
Err(_) => Entry::Char(
|
||||
p.strip_prefix("\"")
|
||||
.unwrap()
|
||||
.strip_suffix("\"")
|
||||
.unwrap()
|
||||
.to_string(),
|
||||
),
|
||||
})
|
||||
.collect()
|
||||
})
|
||||
.collect();
|
||||
rules.insert(k, sub);
|
||||
});
|
||||
expand_rulemap(rules)
|
||||
}
|
||||
|
||||
#[aoc_generator(day19)]
|
||||
fn generator(input: &str) -> Input {
|
||||
let mut it = input.split("\n\n");
|
||||
let rules = make_rules(
|
||||
it.next()
|
||||
.unwrap()
|
||||
.split('\n')
|
||||
.map(|s| s.trim().to_string())
|
||||
.collect(),
|
||||
);
|
||||
|
||||
let messages = it
|
||||
.next()
|
||||
.unwrap()
|
||||
.split('\n')
|
||||
.map(|s| s.trim().to_string())
|
||||
.collect();
|
||||
Input { rules, messages }
|
||||
}
|
||||
|
||||
#[aoc(day19, part1)]
|
||||
fn solution1(input: &Input) -> usize {
|
||||
input
|
||||
.messages
|
||||
.iter()
|
||||
.filter(|msg| input.rules.is_match(msg))
|
||||
.count()
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use super::*;
|
||||
const INPUT: &'static str = r#"0: 4 1 5
|
||||
1: 2 3 | 3 2
|
||||
2: 4 4 | 5 5
|
||||
3: 4 5 | 5 4
|
||||
4: "a"
|
||||
5: "b"
|
||||
|
||||
ababbb
|
||||
bababa
|
||||
abbbab
|
||||
aaabbb
|
||||
aaaabbb"#;
|
||||
|
||||
#[test]
|
||||
fn part1() {
|
||||
assert_eq!(solution1(&generator(INPUT)), 2);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn parse() {
|
||||
assert_eq!(
|
||||
generator(INPUT),
|
||||
Input {
|
||||
rules: Regex::new("^a((aa|bb)(ab|ba)|(ab|ba)(aa|bb))b$").unwrap(),
|
||||
messages: vec!["ababbb", "bababa", "abbbab", "aaabbb", "aaaabbb",]
|
||||
.into_iter()
|
||||
.map(|s| s.to_string())
|
||||
.collect(),
|
||||
}
|
||||
);
|
||||
}
|
||||
#[test]
|
||||
fn expand() {
|
||||
use Entry::*;
|
||||
let r: HashMap<usize, Vec<Vec<Entry>>> = vec![
|
||||
vec![vec![Rule(1)]],
|
||||
vec![vec![Rule(2), Rule(2)], vec![Rule(3), Rule(3)]],
|
||||
vec![vec![Char("a".to_string())]],
|
||||
vec![vec![Char("b".to_string())]],
|
||||
]
|
||||
.into_iter()
|
||||
.enumerate()
|
||||
.collect();
|
||||
assert_eq!(
|
||||
expand_rulemap(r).as_str(),
|
||||
Regex::new("^(aa|bb)$").unwrap().as_str()
|
||||
);
|
||||
}
|
||||
}
|
||||
@ -7,6 +7,8 @@ pub mod day14;
|
||||
pub mod day15;
|
||||
pub mod day16;
|
||||
pub mod day17;
|
||||
//pub mod day18;
|
||||
pub mod day19;
|
||||
pub mod day2;
|
||||
pub mod day3;
|
||||
pub mod day4;
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user