Digit Generator UVA-1583 (generating Element)

For a positive integer n, the digit-sum of N is dened as the sum of n itself and its digits.
When M was 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 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 nd 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 in the RST line of the input. Each test case takes one line containing an integer n, 1 <= n <=? 100000. Output Your program was 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 '.
Sample Input 3 216121 2005 Sample Output 198 0 197
 

Hit the table directly .....

#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <iomanip>

using namespace std;

const int MAXN = 1E5+7;

int A[MAXN];

int getnum (int n) {
    int sum = n;
    while (n) {
        sum + = (n%10);
        n/=;
    }
    return sum;
}

void init ()
{
    memset (a,255,sizeof (a));
    for (int i = 0; i < MAXN; i++)
    {
        int x = Getnum (i);
        if (a[x] = =-1) a[x] = i;
    }
    for (int i = 0; i < MAXN; i++)
    {
        if (a[i] = = 1) a[i] = 0;
    }
}

int main ()
{
    int t,n;
    scanf ("%d", &t);
    cout << a[0] << Endl;
    Init ();
    while (t--)
    {
            scanf ("%d", &n);
            printf ("%d\n", A[n]);
    }
    return 0;
}