Numerot

#include <iostream>
#include <bits/stdc++.h>
 
typedef long long ll;
 
#define M 1000000007
 
using namespace std;
 
 
int table[1000001];
 
int zero(int num) {
	//cout << num << "\n";
	if (num == 0)
		return 0;
	if (num < 0) return 1e9;
	if (table[num]) {
		return table[num];
	}
		
	
	int m = 1e9;
	int t = num;
	while (t > 0) {
		int d = t % 10;
		t /= 10;
		if (d == 0) continue;
		m = min(zero(num - d) + 1, m);
	}
	table[num] = m;
 	return m;
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;

    for (int i = 1; i <= 1e6; ++i) {
        zero(i);
    }

    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;

        for (int j = 1; j <= 1e6; ++j) {
            if (table[j] == x) {
                cout << j << endl;
                break;
            }
        } 
    }
	
 
	return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED