Numerot

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
int maxdigit(int n) {
    int ans = 0;
    while (n > 0) {
        ans = max(ans,n%10);
        n /= 10;
    }
    return ans;
}
 
int dp[20000000];
int lol[20000000];
 
void testCase() {
    int n;
    cin >> n;
    cout << dp[n] << "\n";
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int ind = 1;
    while (dp[1000000] == 0) {
        lol[ind] = 1 + lol[ind-maxdigit(ind)];
        if (lol[ind] > lol[ind-1]) {
            dp[lol[ind]] = ind;
        }
        ind++;
    }
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        testCase();
    }
}
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: RUNTIME ERROR