def test_feedback_loop():
assert feedback_loop(
parse_code(
"3,26,1001,26,-4,26,3,27,1002,27,2,27,1,27,26,27,4,27,1001,28,-1,28,1005,28,6,99,0,0,5"
), (9, 8, 7, 6, 5)) == 139629729
assert feedback_loop(
parse_code(
"3,52,1001,52,-5,52,3,53,1,52,56,54,1007,54,5,55,1005,55,26,1001,54,-5,54,1105,1,12,1,53,54,53,"
+
"1008,54,0,55,1001,55,1,55,2,53,55,53,4,53,1001,56,-1,56,1005,56,6,99,0,0,0,0,10"
), (9, 7, 8, 5, 6)) == 18216
def test_max_thruster():
assert max_thruster(
parse_code("3,15,3,16,1002,16,10,16,1,16,15,15,4,15,99,0,0"),
(4, 3, 2, 1, 0)) == 43210
assert max_thruster(
parse_code(
"3,23,3,24,1002,24,10,24,1002,23,-1,23,101,5,23,23,1,24,23,23,4,23,99,0,0"
), (0, 1, 2, 3, 4)) == 54321
assert max_thruster(
parse_code(
"3,31,3,32,1002,32,10,32,1001,31,-2,31,1007,31,0,33,1002,33,7,33,1,33,31,31,1,32,31,31,4,31,99,0,0,0"
), (1, 0, 4, 3, 2)) == 65210
def find_inputs(code_str, exp):
for noun in range(0, 100):
for verb in range(0, 100):
code = parse_code(code_str)
code[1] = noun
code[2] = verb
icc = IntCodeComputer()
ans = icc.compute(code)
if ans[0] == exp:
return 100 * noun + verb
import pathlib
from aoc2019.intcode import IntCodeComputer, parse_code
if __name__ == "__main__":
with open(pathlib.Path(__file__).parent / 'input') as f:
code_str = f.readline()
code = parse_code(code_str)
icc = IntCodeComputer()
ans = icc.compute(code)
print('answer: %s' % ans[0])