本文链接：https://blog.csdn.net/qq_43993717/article/details/86601279

Find The Multiple

问题链接

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

问题分析

直接bfs搜索，注意剪枝和终止条件即可。

AC代码

#include <iostream>
#include<string.h>
using namespace std;
int flag;
void dfs(long long int n,int k,int deep)
{
	if(flag||deep>=20)
	return ;
	if(n%k==0)
	{
		cout<<n<<endl;
		flag=1;
		return ;
	}
	dfs(n*10,k,deep+1);
	dfs(n*10+1,k,deep+1);
}
int main()
{
     int n;
     while(cin>>n&&n)
     {
         flag=0;
         dfs(1,n,1);
     }
    return 0;	
}