Numerot

#include <iostream>
#include <unordered_map>
using namespace std;
typedef unsigned long long ull;
typedef pair<ull, int> P;
 
unordered_map<ull, P> M[10];
 
P f(unsigned k, ull n) {
	if (n==0 && k==0) return {0, 0};
	if (n<=k) return {1, k-n};
	if (n<10) return {1, 0};
	auto& dp = M[k][n];
	if (dp.first > 0) return dp;
	ull g=1;
	for(; g<=n/10; g*=10);
	ull res=0;
	while(1) {
		unsigned a = n/g;
		P p = f(max(k,a), n%g);
		res += p.first;
		if (a==0) return dp = {res, p.second};
		n = a*g - p.second;
		if (p.second == 0) {
			n -= max(a,k);
			res++;
		}
	}
}
 
int main() {
	int t;cin>>t;
	while(t--){
		ull x;cin>>x;
		ull low=x-1, hi=9*x;
		while(hi-low>1) {
			ull mid = low+(hi-low)/2;
			if (f(0,mid).first < x) low=mid;
			else hi=mid;
		}
		cout<<hi<<'\n';
	}
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED