2335.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2335 on 2006-08-26 at 02:08:04 */ 
#include <cstdio>

const int L = 128;

int main()
{
	int T;
	
	scanf("%d", &T);
	for(int t = 1; t <= T; t++) {
		int n, k; scanf("%d %d", &n, &k);
		if(n > k) { printf("0\n"); continue; }
		int s[L], sn = 0, r = 0, b = k;
		while(true) {
			s[sn++] = b;
			int cr = n*b+r;
			b = cr%10; r = cr/10;
			if(b == k && r == 0) break;
		}
		for(int i = sn-1; i >= 0; i--) printf("%d", s[i]);
		putchar('\n');
	}
	
	return 0;
}