Find The Multiple UVALive

简单BFS 

#include <iostream>
using namespace std;
#include<string.h>
#include<set>
#include<stdio.h>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include <cstdio>
#include <cstdlib>
long long  p1(long long n)
{
    return n*10;
}
long long p2 (long long n)
{
    return n*10+1;
}
int main()
{
    long long n,s;
    while(cin>>n)
    {
        if(!n)
            break;
        queue<long long>TM;
        TM.push(1);
        while(!TM.empty())
        {
            if(TM.front()%n==0)
                break;
            for(int i=0;i<2;i++)
            {
                if(i==0)
                    s=p1(TM.front());
                else
                    s=p2(TM.front());
                TM.push(s);
            }
            TM.pop();
        }
        cout<<TM.front()<<endl;
    }
    return 0;
}