搜索-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

题目要求给一个n你找到一个能整除n的只有0和1构成的数，不要求最短；

这个题一开始我觉得要用到高精度计算来着，但是看了别人的代码，大多数都是用的unsigned long long也出了；

除去这方面，其他没什么太难的，简单深搜；

代码如下：

#include<iostream>using namespace std;typedef unsigned long long ULL;int flag;void dfs(ULL a,ULL n,int k){        if(flag)                return;        if(a%n==0)        {                flag=1;                cout<<a<<endl;                return;        }        if(k==19)                return;        dfs(a*10,n,k+1);        dfs(a*10+1,n,k+1);}int main(){        ULL n;        while(cin>>n)        {                if(n==0)                        break;                else                {                        flag=0;                        dfs(1,n,0);                }        }}