搜索-H

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

26190

Sample Output

10100100100100100100111111111111111111

这道题大致的意思就是输入一个数，寻找一个能被这个数整除的数，并且只含1或0，这道题不是很难使劲深搜就行了。

下面是我的AC代码：

#include<iostream>#include<stdio.h>#include<string.h>#include<queue>using namespace std;long long mod[600001];int main(){    int n;    while(~scanf("%d",&n)&&n)    {        int i;        for(i=1;;i++)        {            mod[i]=mod[i/2]*10+i%2;            if(mod[i]%n==0)            {                break;            }        }        cout<<mod[i]<<endl;    }    return 0;}