Find The Multiple

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

题意：
给你一个n，找出一个只有0和1组成的能被n整除的数。
代码：

#include<stdio.h>
long long n,f;
void dfs(long long k,int x)
{
    if(x>19)
        return;
    if(k%n==0)
    {
        f=1;
        printf("%lld\n",k);
        return;
    }
    dfs(k*10,x+1);
    if(f==1)
        return;
    dfs(k*10+1,x+1);
    return;
}
int main()
{
    while(~scanf("%lld",&n),n)
    {
        f=0;
        dfs(1,1);
    }
    return 0;
}