Find The Multiple

                                                                                                                   Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 32523		Accepted: 13602		Special Judge

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

题意：给出一个整数，求出它的任意一个十进制倍数，且这个倍数只能由0或1组成。

思路：用dfs

#include<stdio.h>
#include<string.h>
int f;
void dfs(unsigned long long int x,int n,int k)
{
    if(f)return ;
    if(x%n==0)
    {
        printf("%llu\n",x);//找到了符合要求的数，输出
        f=1;//标记
        return;
    }
    if(k==19)return;//回溯
    dfs(x*10,n,k+1);
    dfs(x*10+1,n,k+1);
}
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        f=0;
        dfs(1,n,0);//从1开始搜，第三个参数表示搜的层数
    }
    return 0;
}