POJ1426 Find The Multiple 解题报告

参考：http://www.cnblogs.com/ACShiryu/archive/2011/07/24/2115356.html

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
int main()
{
    int n;
    while (cin>>n,n)
    {
        queue<long long> q;
        q.push(1);
        while (!q.empty())
        {
            long long temp=q.front();
            q.pop();
            if (temp%n==0)
            {
                cout<<temp<<endl;
                break;
            }
            q.push(temp*10);
            q.push(temp*10+1);
        }
    }

    return 0;
}