搜索--广搜 E - Find The Multiple

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

注意：

  1.其实有一个疑问，题目上不是说明m是小于100位的吗，那long long型的数据应该存在问题啊。

 2.队列和栈中p.empty()和p.size()都是判断是否为空的条件。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue> 
using namespace std;
long long n;
void bfs(long long num)
{
	queue<long long>p;
	p.push(num);
	long long s;
	while(!p.empty())
	{
		s=p.front();
		p.pop();
		if(s%n==0)
		{
			 cout<<s<<endl;
			 return ;
		}
		  
		else
		{
			p.push(s*10);
			p.push(s*10+1);
		}
	}
}
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0)  break;
		bfs(1);	
	}
	return  0;
}