Numerot

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

typedef long long ll;

int t[10101010], ans[1111000], k[10];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //Älä käytä, jos tehtävä on interaktiivinen!
    int n;
    cin >> n;
    k[0]=1;
    for (int i=1; i<=7; ++i) k[i]=k[i-1]*10;
    for (int i=1; i<=10000000; ++i){
        int a=0;
        for (int j=1; j<=7; ++j){
            a = max(a, (i/k[j-1]%k[j]));
        }
        /*string s=to_string(i);
        for (auto u:s){
            a = max(a, u-'0');
        }*/
        t[i]=t[i-a]+1;
        if (t[i]>t[i-1] && t[i]<=1000000) ans[t[i]]=i;
    }
    for (int i=1; i<=n; ++i){
        int a;
        cin >> a;
        cout << ans[a] << "\n";
    }
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: RUNTIME ERROR