UVA 1583 Digit Generator

Original question:
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 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 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 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
216
121
2005

Sample Output
198
0
1979

English:

Give you a number x, if x can be obtained by y plus each of y, then y is the generating element of x ~
Now give you a number n from 1 to 100000, and ask you how much this number of the smallest generator is.

#include <bits/stdc++.h>

using namespace std;
typedef long long LL;

int solve (int x)
{
    int ans=0;
    while (x)
    {
        ans+=x%10;
        x/=10;
    }
    return ans;
}

int main ()
{
    Ios::sync_with_stdio (false);
    int t,n;
    cin>>t;
    while (t--)
    {
        cin>>n;
        int tmp=n,dig=0;
        while (TMP)
        {
            tmp/=10;
            dig++;
        }
        int flag=0;
        for (int i=n-dig*9;i<n;i++)
        {
            if (i+solve (i) ==n)
            {
                flag=1;
                cout<<i<<endl;
                break;
            }
        }
        if (!flag)
            cout<<0<<endl;
    }
    return 0;
}

Answer:

Purple books on the example, quite simple, the book is to do the table.

In fact, it can be considered that the generator of a number cannot exceed its own, that is, the smallest time is n minus each bit is 9 of the case.
So down enumeration can be