POJ - 1426 Find The Multiple

POJ - 1426 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

题解

之前写过一篇暴力写法，没有用bfs的技巧，现在补上用bfs的解题方法好了

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<vector>
#include<queue>
#include<set>
using namespace std;
int x;
typedef long long LL;
struct node{
	LL n,mod;
};
node now,start,next;
void bfs(){
	queue<node> q;
	q.push(start);
	while(q.size()){
		now=q.front();
		q.pop();
		for(int i=0;i<=1;i++){
			next.n=now.n*10+i;
			next.mod=(now.mod*10+i)%x;
			q.push(next);
			if(next.mod==0){
				cout<<next.n<<endl;
				return ;
			}
		}
	}
}
int main(){	
	while(1){
		cin>>x;
		if(x==0)break;
		start.mod=1;start.n=1;
		bfs();
	}
    return 0;
}