POJ1426BFS

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 32884   Accepted: 13755   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组成的且能整除其的随意一个数。

        解题思路：这个题知道知道有两种走法，即n*10和n*10+1，连标记数组都不需要，因为只需要往前走就行了。以下是我的AC代码

#include <iostream>
#include <cstdio>
#include <cmath>
#include <queue>
using namespace std;

int n;
int bfs()
{
    int l=0;
    queue<long long> q;
    long long now,next;
    now=1;
    q.push(now);
    while(!q.empty())
    {
        now=q.front();
        q.pop();
        if(now%n==0)
        {
            printf("%lld\n",now);
            break;
        }
        for(int i=0; i<2; i++)
        {
            if(i==0) next=now*10;
            else next=now*10+1;
            q.push(next);
        }
    }
}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        bfs();
    }
    return 0;
}