Numerot

#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define F first
#define S second
 
using namespace std;
const ll INF=9000000000000000000LL;
 
ll stepcnt[19][10][10];
ll red[19][10][10];
 
void process() {
	for (int i=1;i<10;i++) {
		for (int j=0;j<10;j++) {
			if (i<=10-j) {
				stepcnt[1][i][j]=2;
				red[1][i][j]=i;
			} else {
				stepcnt[1][i][j]=1;
				red[1][i][j]=i-(10-j);
			}
		}
	}
	for (int po=2;po<=18;po++) {
		for (int i=1;i<10;i++) {
			for (int j=0;j<10;j++) {
				int cu=j;
				for (int k=0;k<10;k++) {
					int lol=max(9-k,i);
					stepcnt[po][i][j]+=stepcnt[po-1][lol][cu];
					cu=red[po-1][lol][cu];
				}
				red[po][i][j]=cu;
			}
		}
	}
}
 
ll steps(ll x) {
	if (x<0) return -1;
	if (x==0) return 0;
	if (x%10==0) {
		ll parsa=0;
		ll chk=x;
		while (chk) {
			if (chk%10 > parsa) parsa=chk%10;
			chk/=10;
		}
		return 1+steps(x-parsa);
	}
	int lol=1;
	ll te=10;
	while (lol<18 && 10*te-(x%(10*te)) < 10) {
		lol++;
		te*=10;
	}
	ll j = te-(x%te);
	ll parsa=1;
	for (ll tmp=x/te;tmp>0;tmp/=10) {
		if (tmp%10 > parsa) parsa=tmp%10;
	}
	
	ll st=stepcnt[lol][parsa][j];
	ll re=red[lol][parsa][j];
	ll ne = (x/te)*te-re;
	return st+steps(ne);
}
 
ll solve(ll x) {
	ll lo=0;
	ll hi=INF;
	while (lo<hi) {
		ll mid=lo+(hi-lo)/2;
		if (steps(mid)<x) lo=mid+1;
		else hi=mid;
	}
	return lo;
}
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	process();
	int tst;
	cin>>tst;
	for (int t=0;t<tst;t++) {
		ll x;
		cin>>x;
		cout<<solve(x)<<"\n";
	}
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED