*寒假水120——广搜

 

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<stdio.h>  
#include<string.h> 
 
int t,n;  

void dfs(unsigned __int64 x,int k)  
{  
    if(t) return;  
    if(x%n==0)  
    {  
        printf("%I64u\n",x);
        t=1;  
        return;  
    }  
    if(k==19) return;
    dfs(x*10,k+1);    
    dfs(x*10+1,k+1);  
}  
int main()  
{  
    while(~scanf("%d",&n)&&n)  
    {  
         t=0;  
         dfs(1,0); 
    }  
}  

题解：我也很好奇为什么我这么皮，题目说广搜，我非要深搜。。。。。。可还是AC了。