1583 Digit Generator
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’.
Sample Input
3
216
121
2005
Sample Output
198
0
1979
code
#include <iostream>
#include<cstring>
#define maxn 100005
int main() {
int ans[maxn];
int T,n;
memset(ans,0,sizeof(ans));
for(int m=0;m<maxn;m++){
int x = m, y = m; // 遍历,由生成元求数
while(x>0){y += x%10;x/=10;} //
if(ans[y] == 0) ans[y] = m; // 直接求最小的.当没有赋值时才能赋值,意味着这里的赋值量是最小值,因为m是递增的.
}
scanf("%d",&T);
while(T--){
scanf("%d",&n);
printf("%d\n",ans[n]);
}
return 0;
}
一次遍历最后查表的方法,很强.
