Sramoc问题(Sramoc Problem) 题解

思路分析

按题目要求使用对应数据结构与算法模拟/递推求解，注意数据范围边界与时间复杂度。

参考代码

#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int k, m;
    if (!(cin >> k >> m)) return 0;
    vector<int> pre(m, -1), dig(m, -1);
    vector<bool> vis(m, false);
    queue<int> q;
    for (int d = 1; d < k; ++d) {
        int r = d % m;
        if (!vis[r]) {
            vis[r] = true;
            pre[r] = -1;
            dig[r] = d;
            if (r == 0) {
                cout << d << "\n";
                return 0;
            }
            q.push(r);
        }
    }
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int d = 0; d < k; ++d) {
            int v = (u * 10 + d) % m;
            if (!vis[v]) {
                vis[v] = true;
                pre[v] = u;
                dig[v] = d;
                if (v == 0) {
                    string ans;
                    int cur = 0;
                    while (cur != -1) {
                        ans.push_back(char('0' + dig[cur]));
                        cur = pre[cur];
                    }
                    reverse(ans.begin(), ans.end());
                    cout << ans << "\n";
                    return 0;
                }
                q.push(v);
            }
        }
    }
    return 0;
}