Digit Generator UVa1583

#include <iostream>
using namespace std;
//求一个数的长度
int lent(int n) {
	if (n < 10)	return 1;
	return 1 + lent(n / 10);
}
#define MIN(n) (lent(n)) * 9 
int main(void) {
	int n;
	while (cin >> n) {
		bool isFinded = false;
		for (int i = MIN(n); i < n; i++) {
			int RS = i;
			int temp = i;
			while (temp > 0) {
				RS += temp % 10;
				temp /= 10;
			}
			if (RS == n) {
				isFinded = true;
				cout << i << endl;
				break;
			}
		}
		if(!isFinded)
			cout << 0 << endl;
	}
}

我偏不用查表法，打我啊~