POJ Find The Multiple1426(bfs)

Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 26632		Accepted: 11029		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

题意：给出一个ｎ,然后求ｍ,m是十进制的只含０，１且ｍ％n=0的数

只含０，１的ｍ,从１开始，ｘ*10 , x*10+1这两个方向

bfs和dfs都能做

ｂｆｓ

</pre><pre name="code" class="cpp">

#include <stdio.h>
#include <queue>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
void bfs(long long n)
{
    queue<long long >q;
    while(!q.empty())q.pop();
    q.push(1);
    long long k,l,m;
    while(!q.empty())
    {
        k=q.front();
        q.pop();
        if(k%n==0)
        {
            printf("%lld\n",k);
            return ;
        }
        l=k;

        if(l*10)
        {
            q.push(l*10);//不能改变l的值，否则会影响下一步
        }
        if(l*10+1)
        {
            q.push(l*10+1);
        }
    }
    return ;
}
int main()
{
    long long n,m;
    while(scanf("%lld",&n)&&n)
    {
        bfs(n);
    }
    return 0;
}