E - Find The Multiple POJ - 1426

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

一道简单的BFS题

#include<iostream>
using namespace std;
int N,M;
struct number{
	long long num1;
}num[100000000];
void BFS()
{
	long long head,tail,x;
	head=0,tail=1;
	x=1;
	num[head].num1=x;
	while(head<tail)
	{
		x=num[head].num1;
		head++;
		num[tail].num1=x*10;
		if(!(num[tail].num1%N))
			break;
		else tail+=1;
		num[tail].num1=x*10+1;
		if(!(num[tail].num1%N))
			break;
		else tail+=1;
	}
	cout<<num[tail].num1<<endl;
}
int main()
{
	while(cin>>N)
	{
		if(N==0)
			break;
		BFS();
	}
	
	return 0;
}