22611_Reverse

Consider a Two-Operation Machine (TOM for short) with nine registers, numbered 1…9. Each register stores a non-negative integer in the range 0…1000. The machine has two operations:

A TOM program includes a set of initial values for the registers and a sequence of operations. Given an integer N ( 0 <= N <= 255 ), generate a TOM program that prints the decreasing sequence of integers N, N-1, N-2, …, 0. The maximum number of consecutive S-operations should be as small as possible.

Example of a TOM program and its execution for N=2:

Input cases are numbered 1 through 16 and are available via the contest server.

The first line of the input file contains K, an integer specifying the input case number.

The second line of input contains N.

The first line of output should be the string “FILE reverse K”, where K is the case number.

The second line of output should contain nine space-separated values representing the desired initial values of the registers, in order (register 1, then register 2, etc.).

The rest of the output file should contain the ordered list of operations to be performed, one per line. Thus, the third line contains the first operation to perform, and so on. The last line of the file should be the one that prints 0. Each line should be a valid operation. The instructions should be formatted as in the example output.