kuangbin带你飞一（搜索）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

题目大意就是：告诉你一个数n，要求你找到你个只有0和1组成的数，可以整除n；

思路：就是简单深搜 ，每次两种情况搜，*10和*10+1；之前疯狂的交了好几发RUNtime erro，最后才发现自己是有个 0的特殊数据会使深搜崩溃（？）

#include
int n;
int flag;
void dfs(long long cur,int k)
{
	if(k==19)
	{
		return ;
	}
	if(flag)
	{
		return ;
	}
	if(cur%n==0)
	{
		flag=1;
		printf("%lld\n",cur);
		return ;
	}
	dfs(cur*10,k+1);
	dfs(cur*10+1,k+1);
}
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0)
		{
			continue;
		 }
		flag=0;
		dfs(1,0);
	}
	return 0;
}