24840번 - Challenge Nine 서브태스크다국어

Ada gives John a positive integer $N$. She challenges him to construct a new number (without leading zeros), that is a multiple of $9$, by inserting exactly one digit (0 …… 9) anywhere in the given number $N$. It is guaranteed that $N$ does not have any leading zeros.

As John prefers smaller numbers, he wants to construct the smallest such number possible. Can you help John?

The first line of the input gives the number of test cases, $T$. $T$ test cases follow.

Each test case has a single line containing a positive integer $N$: the number Ada gives John.

For each test case, output one line containing Case #x: y, where $x$ is the test case number (starting from 1) and $y$ is the new number constructed by John. As mentioned earlier, $y$ cannot have leading zeros.

• $1≤T≤100$.

시간 제한: 20 초

• $1≤N≤10^5$.

시간 제한: 40 초

For at most 10 cases:

• $1≤N≤10^{123456}$.

For the remaining cases:

• $1≤N≤10^5$.

In Sample Case #1, there are only two numbers that can be constructed satisfying the divisibility constraint: $45$ and $54$. John chooses the smaller number.

In Sample Case #2, $333$ is the only number possible.

In Sample Case #3, there are four possible options - $212121$, $122121$, $121221$ and $121212$ - out of which the smallest number is $121212$.