上海交通大学计算机复试上机题,07年-上海交通大学-计算机上机复试真题

经典之作

二零零七年上海交通大学计算机上机复试真题

Problem A. Old Bill

Input file: standard input

Output file: standard output

Among grandfather's papers a bill was found.

72 turkeys $_679_

The first and the last digits of the number that obviously represented the

total price of those turkeys are replaced here by blanks (denoted _), for

they are faded and are illegible. What are the two faded digits and what

was the price of one turkey?

We want to write a program that solves a general version of the above

problem.

N turkeys $_XYZ_

The total number of turkeys, N, is between 1 and 99, including both. The

total price originally consisted of five digits, but we can see only the

three digits in the middle. We assume that the first digit is nonzero, that

the price of one turkeys is an integer number of dollars, and that all the

turkeys cost the same price.

Given N, X, Y, and Z, write a program that guesses the two faded digits and the original price. In case that there is more than one candidate for the

original price, the output should be the most expensive one. That is, the

program is to report the two faded digits and the maximum price per turkey for the turkeys.

Input

The first line of the input file contains an integer N (0

represents the number of turkeys. In the following line, there are the

three decimal digits X, Y, and Z., separated by a space, of the original

price $_XYZ_.

Output

For the input case, there may be more than one candidate for the original

price or there is none. In the latter case your program is to report 0.

Otherwise, if there is more than one candidate for the original price, the

program is to report the two faded digits and the maximum price per turkey for the turkeys.

Sample input and output

Standard input standard output