POJ1426-Find The Multiple-bfs

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

题意：找到只由0或1组成的小于100位的数能够整除题目给出的数据

 #include<iostream>
 #include<queue>
 using namespace std;

 int n;
 void bfs(int x)
 {

     queue<long long>Q;
     long long p=;
     Q.push(p);
     while(!Q.empty())
     {
         p=Q.front();
         Q.pop();
         if(p%n==)
         {
             cout<<p<<endl;
             break;
         }
         Q.push(p*);
         Q.push(p*+);
     }
     return ;
 }

 int main()
 {
     std::ios::sync_with_stdio(false);
     while(cin>>n)
     {
         if(n==)
             break;
         else
         {
             bfs(n);
         }
     }
     return ;
 }