UVA 1583 Digit Generator

Digit Generator

Time Limit:3000MS

Memory Limit: Unknown

64bit IO Format: %lld &%llu

Submit Status

Description

For a positive integer n, the digit-sum of n are defined as the sum OfN itself and its digits. When M was the digitsum of N, we call N Agenerator 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 Ttest 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, 1N100, 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

Note: Do not define Max min in 1:c++ because there are two functions in the algorithm before the RE is present

#include <stdio.h>
#include <string.h>
#define MAXN 100005//c++ do not define MAX when you submit the problem
int main ( void)
{   int hash[maxn];
    int t,a,k,ii,i;
    memset (hash,0,sizeof (hash));
    for (i=0; i<maxn; i++)
    {
        ii=i;
        k=i;
        while (ii)
        {
            k+=ii%10;
            ii/=10;
        }
        if (hash[k]==0| | I<HASH[K]) hash[k]=i;//plus i