H - 08

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

题意：
十进制数每位上只出现0或1，找到是n的倍数的数，最多100位

分析：

用深搜到100超时，直接搜到20位就行

代码：

#include<iostream>
using namespace std;
long long a,b;
int i,t,n;
int s,z;
void vp(long long b,int t,int n)
{
if (t<20&&!s)
{if (b%n==0) {
	s=1;cout<<b<<endl;
	return ;}
else {
	vp(b*10,t+1,n);
	vp(b*10+1,t+1,n);
	}
}
}
int main()
{
    while (cin>>n&&n)
    {
        s=0;
        vp(1,1,n);
    }
}

感受：

这是我做的第一个 深搜，一开始的时候就是懵，完全不知道用什么，可是做出来就感觉会了，不难