poj 1426 Find The Multiple

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
题目意思看懂后不敢动手，因为题目说了m最大位数少于100，以为是属于大数范畴，迟迟不敢动手，后来看了别人的解题报告，试写了一个bfs代码，用G++交了，并且过了。注意用C++交的话最好不要用STL里面的
queue,还是自己用数组模拟队列吧。
要是这一题没放在bfs里面，真的不知道怎么动手了……

#include <iostream>
#include <queue>

using namespace std;
int n;
long long  bfs()
{
    queue<long long>q;
    while(!q.empty())
    {
        q.pop();
    }
    q.push(1);
    while(1)
    {
        long long  p=q.front();
        if(p%n==0)
        return p;
        q.pop();
        q.push(p*10);
        q.push(p*10+1);
    }
}
int main()
{
    while(cin>>n && n)
    {
        long long res=bfs();
        cout<<res<<endl;
    }
    return 0;
}