Numerot

#include <iostream>
#include <algorithm>

int f[1000002];

int ff(int i) {
	int min = 0xffffff;
	for (int j = i; j; j /= 10) {
		int num = j % 10;
		if (num) {
			int k = f[i - num] + 1;
			if (k < min) {
				min = k;
			}
		}
	}
	return min;
}

int main() {
	for (int i = 1; i <= 1000000; ++i) {
		f[i] = ff(i);
	}

	int t;
	std::cin >> t;
	for (int i = 0; i < t; ++i) {
		long x;
		std::cin >> x;
		if (x > 1000000) return 1;
		auto p = std::lower_bound(f, f + 1000000, x);
		if (*p == x) {
			std::cout << (p - f) << '\n';
		} else {
			std::cout << "-1\n";
		}
	}
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: RUNTIME ERROR