Digit Generator（生成元）

标签：题目   not   return   exactly   self   bsp   style   clu   scanf   

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

这道题目看的时间久了点，开始一直没弄懂题意，后来看了很多篇博客才明白了。
大概题意就是：如果x加上x的各个数字之和得到y，就说x是y的生成元。给出n（1<=n<=100000）求最小生成元，无解输出0。如，n=216,121,2005时的解分别为198,0,1979.
例如：216=198+1+9+8（198分别可拆成数字1,9,8）

 1 #include<stdio.h>
 2 #include<string.h>
 3 #define maxn 100005
 4 int ans[maxn];
 5 int main()
 6 {
 7     int T,n;
 8     memset(ans,0,sizeof(ans));
 9     for(int m=1;m<maxn;m++){
10         int x=m,y=m;
11         while(x>0){y+=x%10;x/=10;}
12         if(ans[y]==0||m<ans[y])ans[y]=m;
13     }
14     scanf("%d",&T);
15     while(T--){
16         scanf("%d",&n);
17         printf("%d\n",ans[n]);
18     }
19     return 0;
20 }

运行结果

3
216
198
121
0
2005
1979

Digit Generator（生成元）

标签：题目   not   return   exactly   self   bsp   style   clu   scanf   

原文地址：http://www.cnblogs.com/bearkid/p/7274049.html