Find The Multiple POJ - 1426

题目链接：https://cn.vjudge.net/problem/POJ-1426

注意：队列在每次使用的时候都需要清空　否则内存会超限

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a));
using namespace std;
#define INF 0x3f3f3f3f
typedef long long ll;
int dir[4][2] = {0,1,0,-1,1,0,-1,0};
const int maxn = 100005;
ll n,ans;
int flag;
queue<ll>q;
void bfs(ll m) {
    q.push(m);
while(!q.empty()){
    ll k = q.front();
    q.pop();
    if(k % n == 0){
        cout << k << endl;
        break;
    }
    q.push(k*10);
    q.push(k*10+1);
}
}
int main()
{
    while(cin >> n&&n) {
    while(!q.empty())
        q.pop();
    flag = 0;
    bfs(1);
    }
    return 0;
}