POJ1426:Find The Multiple（BFS）

Description

Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.

Input

The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.

Output

For each value of n in the input print a line containing the corresponding value of m. The decimal representation of m must not contain more than 100 digits. If there are multiple solutions for a given value of n, any one of them is acceptable.

Sample Input

2
6
19
0

Sample Output

10
100100100100100100
111111111111111111

一开始还以为要解决大数求模的问题，结果看到了discuss里面有人用long long 解决了

于是就成了BFS水题了。。。对了C++  TLE，G++就过来，下次超时真的要试一试别的编译器

#include<iostream>
#include <queue>
using namespace std;
long long bfs(int n)
{
	queue<long long>Q;
	while (!Q.empty())
		Q.pop();
	Q.push(1);
	while (1)
	{
		long long cur = Q.front();
		if (0==cur%n)
			return cur;
		Q.pop();
		Q.push(cur * 10);
		Q.push(cur * 10 + 1);
	}
}

int main()
{
	int n;
	while (cin>>n, n)
	{
		cout << bfs(n)<<endl;
	}
		return 0;
}