Numerot

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 1e7;
int dp[N + 1];
int ans[N + 1];

ll reduce(ll v) {
	ll tmp = v;
	ll mx = 0;
	while(tmp) {
		mx = max(mx, tmp % 10);
		tmp /= 10;
	}
	return v - mx;
}

void solve() {
	ll x;
	cin >> x;
	cout << ans[x] << '\n';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	for (int v = 1; v <= N; ++v) {
		dp[v] = 1 + dp[reduce(v)];
		if (dp[v] > dp[v-1]) ans[dp[v]] = v;
	}

	int t;
	cin >> t;
	for (int ti = 0; ti < t; ++ti) solve();
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: RUNTIME ERROR