E - 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. 输入范围比较小，直接本地打表

2. 打表过程发现其实最后结果的数据范围不是很大，直接DFS

3. 数学分析路线：BFS+同模求余

#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
unsigned long long res;
int n,flag;

void dfs(unsigned long long cur, int step)
{
    if(cur%n==0) res=cur,flag=1;
    if(flag==1||step==19) return;
    dfs(10*cur,step+1);
    dfs(10*cur+1,step+1);
}


int main()
{
    while(cin>>n && n!=0)
    {
        flag=0,res=0;
        dfs(1,1);
        cout<<res<<endl;
    }
    return 0;
}