E - Find The Multiple

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 <queue>

using namespace std;
int n,flag;
void dfs(long long cur,int step)
{
    if(step == 19 || flag) return;///当m为19位时，会超出longlong的范围类型
    if(cur % n == 0)
    {
        flag = 1;
        cout << cur << endl;
        return;
    }
    dfs(cur*10,step+1);///两种的选择，增加1或者0
    dfs(cur*10+1,step+1);
}

int main()
{
    while(cin>>n&&n)
    {
        flag = 0;
        dfs(1,0);///开始的时候，m只能是1，并且增加的位数是0

 }
    return 0;
}