Digit Generator（水）

题目链接：http://acm.tju.edu.cn/toj/showp2502.html2502.   Digit Generator

---

Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 2426   Accepted Runs: 1579

---

For a positive integer N, the digit-sum of N is defined as the sum of N itself and its digits. When M is 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 do not have any generators and some numbers have more than one generator. For example, the generators of 216 are 198 and 207.

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

Input

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

Output

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

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

Sample Input

3
216
121
2005

Output for the Sample Input

198
0
1979
数组应用水题直接给代码：

 #include<cstdio>
 #include<cstring>
 #include<string>
 using namespace std;
 int main()
 {
     char num[];
     int T;
     scanf("%d",&T);
     while(T--)
     {
         scanf("%s",num);
         int tm = *strlen(num);
         int sum =num[]-'';
         for(int i = ;i < strlen(num) ;i++)
         {
             sum*=;
             sum+=(num[i]-'');
         }
         int tt = sum - tm;
         int i;
         for( i = tt ; i < sum ; i++)
         {
             int ga = i;
             int flag = ;
             while(ga > )
             {
                 flag+=ga%;
                 ga = ga/;
             }
             if((i+flag)==sum)
             {
                 printf("%d\n",i);
                 break;
             }
         }
         if(i==sum) puts("");
     }
     return  ;
 }