poj 1426 Find The Multiple——bfs广度优先搜索

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

题意： 给出一个n，求它的一个倍数只含有0或1。

题解： bfs广度优先搜索，要想只含有0或1，在最开始初始值设置为1，往后每次乘以10或者是乘以10再加1。

c++ AC 代码

#include<queue>
#include<cstdio>
#include<iostream>
typedef unsigned long long ull;

void bfs(int n)
{
	std::queue<ull> que;
	que.push(1);
	while(1)
	{
		ull num = que.front();
		if(num%n==0)
		{
			printf("%lld\n",num);
			return;
		}
		que.pop();
		que.push(num*10);
		que.push(num*10+1);
	}
}

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