POJ - 1426 Find The Multiple 简单搜索bfs

#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
#include <cstdio>
#include <cmath>
#define ll long long
using namespace std;
int main()
{
    ll n,k;
    while (~scanf("%lld",&n)&&n)
    {
        queue<ll>q;
        q.push(1);
        while (!q.empty())
        {
            k=q.front();
            if(k%n==0)break;
            q.pop();
            q.push(k*10);
            q.push(k*10+1);
        }
        printf("%lld\n",k);
    }
    
    return 0;
}