POJ 1426 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 % m的倍数，并把它输出。它的这个倍数只能由0和1组成

题解：

直接套用dfs 模板，注意我们只需要搜索到一个可行值就行了，所以找到一个就可以不用继续往下搜索了。所以使用了一个标记 flag变量。

AC代码

#include <iostream>

using namespace std;

typedef unsigned long long ll;

ll n;
ll result;
int flag;        //找到标记，找到一个就不用往后面找 

void dfs(ll m, int n, int c){ 
	if(flag) return;
	if(m % n == 0) {
		result = m;
		flag = 1;    
		return ;
	}
	if(c > 19) return ;
	
	dfs(m*10,n,c+1);
	dfs(m*10+1,n,c+1);
} 

int main(){
	while(1){
		cin>>n;
		if(n == 0) return 0;
		
		flag = 0;
		result = 0;
		dfs(1,n,1);  // 参数意义 从 1 开始，n 我们的输入， 1 现在只有1位 
		cout<<result<<endl; 	
	}
}