Digit Generator(UVa 1583)

Digit Generator

Time Limit: 3000ms

Memory Limit: Unknown KB

This problem will be judged on  UVA. Original ID:  1583
64-bit integer IO format:  %lld      Java class name:  Main

Prev 

Submit  Status  Statistics  Discuss

  Next

[PDF Link]

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 , 1N100, 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

198 

0 
1979

代码分析：为了提高效率，不用每次计算一个n的生成元，而是先计算出1-100000的生成元，然后查表

#include<stdio.h>
#include<string.h>
#define maxn 100005
int ans[maxn];


int main()
{
	int T,n,x,y;
	memset(ans, 0, sizeof(ans));
	
	for(int i=1;i<maxn;i++)
	{
		x = i;
		y = i;
		while(x%10) 
		{
			y += x%10;
			x /= 10;	
		}  
		if(ans[y] == 0||ans[y] > i) ans[y] = i; 
		
	}	
	
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		printf("%d\n",ans[n]);
	}
	
	return 0;
}