Interpreter P33564


Statement
 

pdf   zip

html

Your task is to write a program that simulates the execution of a program written in a certain assembly language (called affectionately Rourix in honor of its inventor). In this language, 100 variables of integer type are exclusively used, x0 … x99, all of them initially with the value 1. The instruction of the program are consecutively stored in labeled postitions 000, 001, 002, … (at most 999). The set of possible instructions is:

||
stop    stops the program.
endl    writes an end of line.
prin i    writes, preceded of a space, the content of xi.
stor i v    stores the value v in the variable xi (xi:=v).
copy i j    copies xj in xi (xi:=xj).
acum i j    accumulates xj in xi (xi:=xi+xj).
subs i j    substracts xj of xi (xi:=xi−xj).
prod i j    multiplies xi by xj (xi:=xi * xj).
goto ℓ    jumps to the instruction of the position ℓ.
jzer i ℓ    jumps to the instruction of the position ℓ only if xi = 0.
jneg i ℓ    jumps to the instruction of the position ℓ only if xi < 0.
||

The program always starts to execute from the position 000. After executing the instruction of a position p, it goes to the following instruction (the one in the position p + 1, which if has to be executed will always exist), except, obviously, with stop, goto, and jzer or jneg when the conditions to jump are true.

All the i and j of the program will be between 0 and 99. All the ℓ are valid lines of program. Executing a program, it will always find a |stop| in some moment.

Input

The input consists of a correct program in assembly language, between 1 and 1000 lines. Each line starts with three redundant digits that indicate its number starting with 000, followed by a space, and the instruction corresponding to that line. The fields of each instruction are also separated by a space. All the directions of jump ℓ have exactly three digits.

Output

Your program must print the same that would print the program in assembler.

Hint

Having a table to store the 100 variable is enough, another table to store the program, and an index that indicates which is the instruction that must be executed imediately after.

Public test cases

  • Input

    000 prin 0
001 acum 0 0
002 prin 0
003 endl
004 stor 1 23
005 prod 0 1
006 stor 3 -9876
007 copy 4 3
008 prin 1
009 prin 0
010 prin 3
011 prin 4
012 endl
013 stop

    Output

     1 2
 23 46 -9876 -9876

  • Input

    000 stor 8 999
001 goto 003
002 prin 0
003 prin 8
004 endl
005 stop
006 prin 0
007 endl
008 stop
009 prin 0

    Output

     999

  • Input

    000 stor 99 -10
001 prin 99
002 acum 99 0
003 jzer 99 005
004 goto 001
005 endl
006 stop

    Output

     -10 -9 -8 -7 -6 -5 -4 -3 -2 -1

  • Input

    000 stor 0 95
001 stor 1 25
002 prin 0
003 prin 1
004 endl
005 subs 0 1
006 jzer 0 014
007 jneg 0 009
008 goto 002
009 acum 0 1
010 copy 2 0
011 copy 0 1
012 copy 1 2
013 goto 002
014 endl
015 prin 1
016 endl
017 stop

    Output

     95 25
 70 25
 45 25
 20 25
 25 20
 5 20
 20 5
 15 5
 10 5
 5 5

 5
    • Information
    Author
    Omer Giménez
    Language
    English
    Translator
    Carlos Molina
    Original language
    Spanish
    Other languages
    Spanish
    Official solutions
    C++
    User solutions
    C++