Numerot

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
const int N = 1e7;
const ll INF = 1e18;
 
ll f[N];
 
ll mi[N];
 
int main() {
	iostream::sync_with_stdio(false);
	cin.tie(0);
//	ofstream out;
//	out.open("output.txt");
 
	for(int i = 1; i < N; ++i) {
		f[i] = INF;
		ll j = i;
		while(j > 0) {
			f[i] = min(f[i], f[i - j%10] + 1);
			j /= 10;
		}
	}
 
	for(int i = 1; i < N; ++i) {
		if(mi[f[i]] == 0) {
			mi[f[i]] = i;
		}
	}
 
 
 
/*
	for(int i = 1; i <= 1e5; ++i) {
		out << i << " " << f[i] << " " << (ld) i/f[i] << "\n";
	}
*/
	int t;
	cin >> t;
	while(t > 0) {
		--t;
		int x;
		cin >> x;
		cout << mi[x] << "\n";
	}
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: RUNTIME ERROR