-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolver_1.py
60 lines (47 loc) · 1.32 KB
/
solver_1.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
#!/usr/bin/env python3
import re
from pathlib import Path
curdir = Path(__file__).parent.absolute()
OPERS = {
"+": lambda x, y: x + y,
"*": lambda x, y: x * y,
}
def find_parenthesis_expression(elements):
par = 1
i = 0
while par > 0 and i < len(elements):
i += 1
if elements[i] == "(":
par += 1
elif elements[i] == ")":
par -= 1
return elements[1:i], i
def calculate_expression(elements):
result = 0
operation = OPERS["+"]
i = 0
while i < len(elements):
if elements[i] == "(":
inner_exp, index = find_parenthesis_expression(elements[i:])
result = operation(result, calculate_expression(inner_exp))
i += index + 1
continue
elif elements[i] in OPERS:
operation = OPERS[elements[i]]
elif elements[i] == "":
pass
else:
number = int(elements[i])
result = operation(result, number)
i += 1
return result
def main():
sum_values = 0
with open(curdir.joinpath("input.txt")) as f:
for line in f.readlines():
sum_values += calculate_expression(
re.split("(\W)", line.strip().replace(" ", ""))
)
print(f"Solution: {sum_values}")
if __name__ == "__main__":
main()