Advent of Code 2019 day 21 solution

aoc19-21.py

# intcode interpreter omitted

def go():
	p = make_process(inp)
	p = start(p)
	while p[0] != DONE:
		if p[0] == INPUT:
			i = input()
			for c in i:
				p = inpt(p, ord(c))
				assert p[0] == INPUT
			p = inpt(p, 10)
		elif p[0] == OUTPUT:
			out = get_output(p)
			if out >= 256:
				print(out)
				return
			print(chr(out), end="")
			p = cont(p)


go()

part1.ss

NOT A J
NOT B T
OR T J
NOT C T
OR T J
AND D J
WALK

part2.ss

NOT A J
NOT B T
OR T J
NOT C T
OR T J
AND D J
NOT H T
NOT T T
OR E T
AND T J
RUN