kuangbin专题一 简单搜索 E - Find The Multiple

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

因为只有0和1所以每次递归要么*10要么*10+1，遇到第一个数就判断跳出dfs

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int N,y;
void dfs(long long x,int sum)
{
	if(y!=0)
	return;
	if(x%N==0){
		cout<<x<<endl;
		y++;
	}
	if(sum>18){
		return;
	}
	dfs(x*10,sum+1);
	dfs(x*10+1,sum+1);
	
}
int main()
{
	while(cin>>N&&N!=0){y=0;
	dfs(1,1);	
	}
	return 0;
}