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

题解：其实就是dsf每次乘10或乘10+1，当能余那个数为零时结束，要加限制条件，防止一直运行下去，一般是>19，要用long long int 不要用unsigned __int64会错，但是当手打限制条件9000000000000000000是可以用unsigned __int64。

代码：

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>

using namespace std;

int flag,a;
void kk(unsigned __int64 ks)
{
    if(flag==1||ks>9000000000000000000)
        return ;
    if(ks%a==0)
    {
        printf("%I64d\n",ks);
        flag=1;
        return ;
    }
    kk(ks*10);
    kk(ks*10+1);
}


int main()
{
    while(~scanf("%d",&a)&&a)
    {
        flag=0;
        kk(1);
    }
    return 0;
}