-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathaoc201701.py
49 lines (34 loc) · 1.1 KB
/
aoc201701.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
"""AoC 1, 2017: Inverse Captcha."""
# Standard library imports
import pathlib
import sys
def parse_data(puzzle_input):
"""Parse input."""
return [int(digit) for digit in puzzle_input]
def part1(data):
"""Solve part 1."""
return equal_sum(data, data[1:] + data[:1])
def part2(data):
"""Solve part 2."""
split_idx = len(data) // 2
return equal_sum(data, data[split_idx:] + data[:split_idx])
def equal_sum(sequence_1, sequence_2):
"""Find sum of digits that are equal in both sequences.
>>> equal_sum([1, 2, 3], [1, 2, 3])
6
>>> equal_sum([1, 2, 3, 4], [4, 3, 2, 1])
0
"""
return sum(
first for first, second in zip(sequence_1, sequence_2) if first == second
)
def solve(puzzle_input):
"""Solve the puzzle for the given input."""
data = parse_data(puzzle_input)
yield part1(data)
yield part2(data)
if __name__ == "__main__":
for path in sys.argv[1:]:
print(f"\n{path}:")
solutions = solve(puzzle_input=pathlib.Path(path).read_text().strip())
print("\n".join(str(solution) for solution in solutions))