POJ - 1426 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


搜索，由于数字只能是1和0组成的。我们从1开始枚举

1  1*10 1*10+1   （1*10）*10  （1*10）*10+1

dfs（num）
{ 
   dfs(num*10);
   dfs(num*10+1);
}
#include <iostream>
#include<string.h>
#include<map>
#include<queue>
using namespace std;
long long n;
long long daan,flag;
void dfs(long long dangqian,int weishu)
{
    if(flag)
        return ;
    if(weishu>19)
    return ;
    if(dangqian%n==0)
    {
        flag=1;
        cout<<dangqian<<endl;
        return ;
    }
    dfs(dangqian*10,weishu+1);
    dfs(dangqian*10+1,weishu+1);
}
int main()
{
    while(cin>>n&&n)
    {
        flag=0;
        dfs(1,1);
    }


}