E - Find The Multiple POJ - 1426(广搜)

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

题目意思：

emm题目的意思是说........找一个可以整除n并且是由0和1组成的数

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int n; 
void BFS(int n)
{
	queue<long long >qu;
	while(qu.empty()==0)
	qu.pop();
	qu.push(1);
	while(1)
	{
		long long tmp=qu.front();
		if(tmp%n==0)
		{
			printf("%lld\n",tmp);
			break;
		}	
		qu.pop();
		qu.push(tmp*10);
		qu.push(tmp*10+1);
		
	}
	return;
}

int main()
{
	while(scanf("%d",&n)&&n)
		BFS(n);
	return 0;
}