【POJ1426】Find The Multiple

#include <iostream>
long long q[1000000]{ 0,1 };
int main() {
	for (long long n, ans, head, tail; std::cin >> n && n; q[1] = 1) {
		for (q[0] = head = tail = 1; head <= tail; head++) {
			tail++; q[tail] = q[head] * 10;
			if (q[tail] % n == 0) { ans = q[tail]; break; }
			tail++; q[tail] = q[tail - 1] + 1;
			if (q[tail] % n == 0) { ans = q[tail]; break; }
		}
		std::cout << ans << std::endl;
	}
}