4219. 找倍数 - AcWing题库(bfs)

4219. 找倍数 - AcWing题库

#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>

#include <queue>
#define x first

#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef pair<string,int> PSI;


int n;

void bfs()
{
    queue<PSI> q;
        q.push({"1",1});
        while(q.size())
        {
            auto t = q.front();q.pop();
            
            if(!t.y)
            {
                cout << t.x << endl;return;
            }    
            
            q.push({t.x+'0',t.y * 10 % n });
            q.push({t.x+'1',(t.y * 10 +1) %n});
        }
    
}

void solve()
{
    while(cin >> n,n)
    {
        bfs();
    }
}
signed main()
{
//    freopen("1.txt","r",stdin);
    ios
    int T=1;
//    cin>>T;
    while(T -- )
    {
        solve();
    }



    return 0;
}