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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
import sys
sys.path.append("../common")
import aoc
from math import sqrt
def parse_command(l):
s = l.split(" ")
args = [s[0]]
args = args + [int(v) for v in s[1:]]
return args
data = aoc.data.split("\n")
inspaddr = int(data[0][4:])
instructs = [parse_command(l) for l in data[1:] if len(l) != 0]
register = [0 for x in range(inspaddr+1)]
opmap = dict()
opmap["addr"] = lambda a, b : register[a] + register[b]
opmap["addi"] = lambda a, b : register[a] + b
opmap["mulr"] = lambda a, b : register[a] * register[b]
opmap["muli"] = lambda a, b : register[a] * b
opmap["banr"] = lambda a, b : register[a] & register[b]
opmap["bani"] = lambda a, b : register[a] & b
opmap["borr"] = lambda a, b : register[a] | register[b]
opmap["bori"] = lambda a, b : register[a] | b
opmap["setr"] = lambda a, b : register[a]
opmap["seti"] = lambda a, b : a
opmap["gtir"] = lambda a, b : 1 * (a > register[b])
opmap["gtri"] = lambda a, b : 1 * (register[a] > b)
opmap["gtrr"] = lambda a, b : 1 * (register[a] > register[b])
opmap["eqir"] = lambda a, b : 1 * (a == register[b])
opmap["eqri"] = lambda a, b : 1 * (register[a] == b)
opmap["eqrr"] = lambda a, b : 1 * (register[a] == register[b])
def solve1(args):
global register, insptr
while register[inspaddr] < len(instructs):
insptr = register[inspaddr]
ins = instructs[insptr]
#aoc.debug(register)
# execute command
if len(register) <= ins[3]:
register += [0 for x in range(ins[3] - len(register) + 1)]
register[ins[3]] = opmap[ins[0]](ins[1], ins[2])
# increment instruction pointer
register[inspaddr] += 1
return register[0]
alpha = [chr(c + ord('a')) for c in range(26)]
dismap = dict()
dismap["addr"] = lambda a, b : "%s + %s" % (alpha[a], alpha[b])
dismap["addi"] = lambda a, b : "%s + %d" % (alpha[a], b)
dismap["mulr"] = lambda a, b : "%s * %s" % (alpha[a], alpha[b])
dismap["muli"] = lambda a, b : "%s * %d" % (alpha[a], b)
dismap["banr"] = lambda a, b : str(alpha[a] & alpha[b])
dismap["bani"] = lambda a, b : str(alpha[a] & b)
dismap["borr"] = lambda a, b : str(alpha[a] | alpha[b])
dismap["bori"] = lambda a, b : str(alpha[a] | b)
dismap["setr"] = lambda a, b : str(alpha[a])
dismap["seti"] = lambda a, b : str(a)
dismap["gtir"] = lambda a, b : "(%d > %s)" % (a, alpha[b])
dismap["gtri"] = lambda a, b : "(%s > %d)" % (alpha[a], b)
dismap["gtrr"] = lambda a, b : "(%s > %s)" % (alpha[a], alpha[b])
dismap["eqir"] = lambda a, b : "(%d == %s)" % (a, alpha[b])
dismap["eqri"] = lambda a, b : "(%s == %d)" % (alpha[a], b)
dismap["eqrr"] = lambda a, b : "(%s == %s)" % (alpha[a], alpha[b])
def disassemble():
for i in range(len(instructs)):
ins = instructs[i]
aoc.debug(i ,":",alpha[ins[3]],"=", dismap[ins[0]](ins[1], ins[2]))
aoc.debug()
""" divisor sum algo disassembled
c = 1
b = 1
a = 0
while b <= f:
c = 1
while c <= f:
if b * c == f:
a += b
c += 1
b += 1
"""
def solve2(args):
f = 10551276 # found by running
res = 0
sqrtf = sqrt(f)
for i in range(1, int(sqrtf)):
if f % i == 0:
res += i + f / i
if int(sqrtf) % f == 0:
res += sqrtf
return int(res)
aoc.run(solve1, solve2, sols=[2072, 27578880])
|
