UVA - 1583 Digit Generator

Digit Generator

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

Submit Status

Description




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 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 do not have any generators and some numbers have more than one generator. For example, the generators of216 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

Sample
Output

198 
0 
1979

打表

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAXN = 100005;
int ans[MAXN];

int main()
{
	for (int i = 1; i <= MAXN; i++)
	{
		int sum = i;
		int m = i;
		while (m)
		{
			sum = sum + m%10;
			m = m / 10;
		}
		if (ans[sum] == 0 || ans[sum] > i) ans[sum] = i;
	}
	
	int casen;
	cin >> casen;
	while (casen--)
	{
		int n;
		cin >> n;
		cout << ans
 << endl;

	}
}