Little Tom is learning how to program. He has just written some programs but is afraid to run them, because he does not know if they will ever stop. Please write a program to help him. This task is not as easy as it may seem, because Tom's programs are possibly not deterministic. Given a program written by Tom, your program should tell him whether his program can stop and if so, what is the shortest possible time before it stops.
Tom's computer consists of 32 1-bit registers and the program consists of n instructions. The registers are numbered from 0 to 31 and the instructions are numbered from 0 to n-1.
Below, MEM[a] stands for the contents of the a-th register, 0 <= a, b < 32, 0 <= x < n, 0 <= c <= 1.
The instruction set is as follows:
| Instruction | Semantics |
AND a b
OR a b
XOR a b
NOT a
MOV a b
SET a c
RANDOM a
JMP x
JZ x a
STOP
|
MEM[a] := MEM[a] and MEM[b]
MEM[a] := MEM[a] or MEM[b]
MEM[a] := MEM[a] xor MEM[b]
MEM[a] := not MEM[a]
MEM[a] := MEM[b]
MEM[a] := c
MEM[a] := random value (0 or 1)
jump to the instruction with the number x
jump to the instruction with the number x if MEM[a] = 0
stop the program
|
The last instruction of a program is always STOP (although there can be more than one STOP instruction). Every program starts with the instruction number 0. Before the start, the contents of the registers can be arbitrary values. Each instruction (including STOP) takes 1 processor cycle to execute.
Task
Write a program that:
reads the program,
computes the shortest possible running time of the program,
writes the result.