(搜索) poj 1426

G - Find The Multiple

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

Submit Status Practice POJ 1426

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<cmath>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;
#define LL long long
queue<LL> q;
LL n;
LL bfs()
{
    LL x;
    while(!q.empty()) q.pop();
    q.push(1);
    while(!q.empty())
    {
        x=q.front(),q.pop();
        if(x%n==0)
            return x;
        q.push(x*10);
        q.push(x*10+1);
    }
}
int main()
{
    while(scanf("%I64d",&n)!=EOF)
    {
        if(n==0)
            break;
        printf("%I64d\n",bfs());
    }
    return 0;
}