POJ 1426 Find The Multiple (Special Judge)

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 28281   Accepted: 11722   Special Judge 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 Source Dhaka 2002

题意大致就是找个十进制数，只能由0和1构成，这里bfs遍历一下就好

这个是(Special Judge)，第一次做，就是说结果可以有很多，只要输出一个就好

ac代码

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>

using namespace std;
long long a[1000000];

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

int main()
{
	long long n;
	
	while(scanf("%I64d",&n),n)
	{
		printf("%I64d\n",bfs(n));
	}
	
	return 0;
}