【poj1426】【BFS】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
Output
10
100100100100100100
111111111111111111

广搜题

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
using namespace std;
 
int n,k;
long long ans;
 
long long bfs(int n)
{
	queue<long long> q;
	q.push(1);
	while(1)
	{
		long long m = q.front();
		if(m%n==0) return m;
		q.pop();
		q.push(m*10);
		q.push(m*10+1);
	}
}
int main()
{
	while(scanf("%d",&n)!=EOF&&n)
	{
		cout<<bfs(n)<<endl;
	}
	return 0;
}