"Uva 1583" Digit Generator

Description

For a positive integer n, the digit-sum of n is defined as the sum of n itself and its digits. When M was the digitsum of N, we call N a generator of M.

For example, the digit-sum of 245 is 256 (= 245 + 2 + 4 + 5). Therefore, 245 is a generator of 256.

Not surprisingly, some numbers does not has any generators and some numbers has more than one generator. For example, the generators of 216 is 198 and 207.

You is to write a program to find the smallest generator of the given integer. Input

Your program was to read from standard input. The input consists of T test cases. The number of test cases T is given on the first line of the input. Each test case takes one line containing an integer N, 1≤\LEN≤\LE100, 000. Output

Your program is-to-write to standard output. Print exactly one line for each test case. The line was to contain a generator of N for each test case. If N has multiple generators, print the smallest. If N does not has any generators, print 0.

The following shows sample input and output for three test cases. Sample Input

3
216
121
2005 Sample Output

198
0
1979 Problem Solving ideas

Find the smallest x so that the sum of the numbers of x + x is y.
The direct enumeration is OK. Reference Code

 #include <stdio.h> const int MAX = 100005; int ans[max]={0}; int main () {int t,n,i;
        for (i = 1;i < max;i++) {int x = I,y = i;
        while (x > 0) {y + = x%10;//from x last start to Y x/= 10; } if (!ans[y])//The condition of the Purple Book is (ans[y] = = 0 | |
    M < Ans[y]), in fact, the latter is not necessary, because the cycle is small to large, so ans[y] Save up must be the smallest ans[y] = i;
    } scanf ("%d", &t);
        while (t--) {scanf ("%d", &n);
    printf ("%d\n", Ans[n]);
} return 0; }