POJ1426 Find The Multiple

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
void bfs(int n)
{
    queue<long long>q;
    while(!q.empty())
    {
      q.pop(); 
    }
    q.push(1);
    while(!q.empty())
    {
        long long current =q.front();
        q.pop();
        if(current%n==0)
        {
            cout<<current<<endl;
            return;
        }
            
        q.push(current*10);
        q.push(current*10+1);
        
    }
 }
int main()
{
 int n;
 while(cin>>n)
 {
     if(n==0)
     break;

     bfs(n);
 }
 return 0;
} 

#include<iostream>
using namespace std;
long long que[9999999];
void bfs(int n)
{
    int head=1,tail=1;
    que[tail++]=1;
    while(head<tail)
    {
        long long now=que[head++];//每次往后一个，相当于Pop了。
        if(now%n==0)
        {
           cout<<now<<endl;
           return;
        }
        que[tail++]=now*10;
        que[tail++]=now*10+1;
    }
}
int main()
{
    int n;
    while(scanf("%d",&n),n!=0)
    {
        bfs(n);
    }
    return 0;
}