Find The Multiple（BFS）

Description

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组成能整除n的数字。所以可以看成根节点为1，每个子节点为0和1的树，每一层遍历。如果能够整除n即为结果。这道题推荐用BFS更快。

#include <iostream>
#include<cmath>
#include<cstring>
#include<queue>
#include<vector>

using namespace std;
typedef long long int ll;
void BFS(int n){
    queue<ll> q;
    q.push(1);
    while(!q.empty()){
        ll tmp = q.front();
        q.pop();
        if(tmp % n == 0){
            //cout<<tmp<<endl;
            printf("%lld\n", tmp);
            return;
        }
        q.push(tmp*10);     //添0        
        q.push(tmp*10+1);     //添1
    }
}
int main(int argc, char const *argv[])
{
    int n;
    while(cin>>n && n){
        BFS(n);
    }
    return 0;
}