UVa 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 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 T test 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.

This problem for each number n from 1 to N-1 to find, has been a timeout. Optimization of the lookup method has also been a timeout. Later did not make out, found that each number and its generator is one by one corresponding, can be from the generator direction to determine its number. The method is that the maximum number is 100000, from 1 to 100000, and the number is determined by the generator. Each number will be checked after the array.

#include "stdio.h"
#include "string.h"
#define MAXN 100001
int GENERATOR[MAXN];

int main ()
{
	memset (generator, 0, sizeof (generator));
	for (int i = 1; i < MAXN; i++)
	{
		int sum = 0, k = i;
		while (k > 0)
		{
			sum + = k%;
			K = K/10;
		}
		Int j = i + sum;
		if (generator[j] = = 0)
			Generator[j] = i;
	}		
	int n;
	scanf ("%d", &n);
	for (int i = 1; I <= n; i++)
	{
		int num;
		scanf ("%d", &num);
		printf ("%d\n", Generator[num]);
	}
	return 0;

}