시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 128 MB | 27 | 17 | 15 | 65.217% |
An N-digit runaround number is characterized as follows:
For example, consider the number 81362. To verify that this is a runaround number, we use the steps shown below:
8 1 3 6 2 -
8 1 3 6 2 - -
8 1 3 6 2 - - -
8 1 3 6 2 - - - -
8 1 3 6 2 - - - - -
8 1 3 6 2 = - - - -
In this problem you will be provided with one or more input lines, each with a single integer R having between 2 and 7 digits followed immediately by the end of line. For each such number, determine the smallest runaround number that is equal to or greater than R. There will always be such a number for each of the input numbers. The last line of the input will contain only the digit 0 in column 1.
Display the resulting number in the format illustrated below.
12 123 1234 81111 82222 83333 911111 7654321 0
Case 1: 13 Case 2: 147 Case 3: 1263 Case 4: 81236 Case 5: 83491 Case 6: 83491 Case 7: 913425 Case 8: 8124956