POJ1426 Find The Multiple （BFS | DFS）

Find The Multiple

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%lld & %llu

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

题意大致为找到一个整数x，使其能够被n整除！

BFS代码如下：

#include <stdio.h>
#include <queue>

using namespace std;

void bfs(int n){
	long long x;
	queue<long long> Q;
	
	Q.push((1));
	
	while(!Q.empty()){
		x = Q.front(); 
		Q.pop();
		
		if(x % n == 0){
			printf("%lld\n",x);
			return;
		}
		
		Q.push(x * 10);
		Q.push(x * 10 + 1);
	}
}

int main(){
	int n;
	
	while(~scanf("%d",&n) && n){
		bfs(n);
	}
	return 0;
}

DFS代码如下：

#include <stdio.h>

int flag;

void dfs(int n,unsigned long long x,int cur){
	if(flag)
		return;
	if(x % n == 0){
		printf("%llu\n",x);
		flag = 1;
		return;
	}
	
	if(cur == 19)
		return;
	
	dfs(n,x*10,cur+1);
	dfs(n,x*10+1,cur+1);
}

int main(){
	int n;
	
	while(~scanf("%d",&n) && n){
		flag = 0;
		dfs(n,1,0);
	}
	return 0;
}