Find The Multiple

 Find The Multiple

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit  Status

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

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<queue>


using namespace std;


queue<long long>que;
long long n,p;


int bfs()
{
    que.push(num);
    while(!que.empty())
    {
        p=que.front();
        que.pop();
        if(p%n==0)
        {
            cout<<p<<endl;
            while(!que.empty()){
                que.pop();
            }
            return 0;
        }
        else{
            que.push(p*10);//用队列就全用队列，不要自己定义一个int推进去。
            que.push(p*10+1);
        }
    }
    return 0;
}
int main()
{
    while(~scanf("%lld",&n) && n)
        bfs();
    return 0;
}