POJ 1426 Find The Multiple（BFS 水~）

Find The Multiple

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18321 Accepted: 7417 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

26190

Sample Output

10100100100100100100111111111111111111

第一次看这个题（挂在了搜索中~），被输出数据吓了一跳，实在没看出来哪里用得到搜索。。。打算暴过去时，突然发现每次不就两种情况么，*10和*10+1。。。

#include <iostream>#include <cstdio>#include <cstring>using namespace std;struct node{    long long int x;}q[10000000];int n;void bfs(){    node t,r;    t.x=1;    int k=0,l=0;    q[l++]=t;    while(k<l)    {        t=q[k++];        if(t.x%n==0)        {            printf("%lld\n",t.x);            return ;        }        r.x=t.x*10;        q[l++]=r;        r.x=t.x*10+1;        q[l++]=r;    }}int main(){    while(scanf("%d",&n),n)    {        bfs();    }    return 0;}