reverse【信息技术】.pdfVIP

Competition Day One Task Description August 18, 2003 Reverse Reverse (output-only task) TASK 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: S i j Store one plus the value of register i into register j . Note that i may equal j . P i Print the value of register i. 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: Operation New Register Values Printed 1 2 3 4 5 6 7 8 9 Value Initial values 0 2 0 0 0 0 0 0 0 P 2 0 2 0 0 0 0 0 0 0 2 S 1 3 0 2 1 0 0 0 0 0 0 P 3 0 2 1 0 0 0 0 0 0 1 P 1 0 2 1 0 0 0 0 0 0 0 Input cases are numbered 1 through 16 and are available via the contest server. Input: The first line of the input file contains K, an integer specifying the input case number. The second line of input contains N. Examp le inp ut: 1 2 Output: 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