POJ---1246

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

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 11000
int n, found;
void DFS(long long t , int k)
{
    if(k==20 || found==1)
        return ;
    if(t%n==0)
    {
        found=1;
        printf("%I64d\n",t);
        return ;
    }
    DFS(t*10,k+1);
    DFS(t*10+1,k+1);
}
int main()
{
    while(scanf("%d",&n),n)
    {
        found=0;
        DFS(1,1);
    }
    return 0;
}