-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path11-2.py
More file actions
38 lines (34 loc) · 1.27 KB
/
11-2.py
File metadata and controls
38 lines (34 loc) · 1.27 KB
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
# python 11-2.py input11.txt
import sys
from collections import namedtuple
monkeys = []
Monkey = namedtuple("Monkey", ["i", "items", "operation", "div", "true", "false"])
f = open(sys.argv[1])
factor = 1
while True:
first_line = f.readline() # Monkey i
if not first_line.startswith("Monkey"):
break
i = int(first_line[7:-2])
items = [int(x) for x in f.readline()[18:-1].split(", ")] # Starting items:
operation = f.readline()[19:-1] # Operation: new =
div = int(f.readline()[21:-1]) # Test: divisible by
true = int(f.readline()[29:-1]) # Test: divisible by
false = int(f.readline()[30:-1]) # Test: divisible by
f.readline() # Empty line
monkeys.append(Monkey(i, items, operation, div, true, false))
factor *= div
f.close()
inspected = [0] * len(monkeys)
ROUNDS = 10000
for i in range(ROUNDS):
for monkey in monkeys:
num_items = len(monkey.items)
inspected[monkey.i] += num_items
for _ in range(num_items):
old = monkey.items.pop()
new_item = eval(monkey.operation) % factor
next_monkey = monkey.true if new_item % monkey.div == 0 else monkey.false
monkeys[next_monkey].items.append(new_item)
inspected = sorted(inspected)
print(inspected[-1] * inspected[-2])