3-5生成元Digit Generator UVA - 1583

#include <iostream>
#include <cstring>
using namespace std;
#define maxn 100044
int ans[maxn];
int main()
{
 int T, index = 1;
 memset(ans, 0, 100044);
 cin >> T;
 while (T--)
 {
  int n;
  cin >> n;
  if (n > index)
  {
   for (int i = index; i < n; ++i)//计算index到n之间的数的生成元
   {
    int x = i, y = i;
    while (x > 0)
    {
     y += x % 10;
     x /= 10;
    }
    if (ans[y] == 0)
     ans[y] = i;
   }
   index = n;
  }
  cout << ans[n] << endl;
 }
}