40求跳
查看原帖
40求跳
1373959
bloxd楼主2025/7/31 23:20
#include <bits/stdc++.h>
using namespace std;
int main() {
    string n;
    int k;
    cin >> n >> k;
    unordered_map<char, vector<char> > er;
    for (int i = 0; i < k; ++i) {
        char x, y;
        cin >> x >> y;
        er[x].push_back(y);
    }
    for (auto& ar : er) {
        char key = ar.first;
        vector<char>& values = ar.second;
        values.push_back(key);
    }
    long long ans = 1;
    for (int i = 0; i < n.size(); ++i) {
        char cur = n[i];
        int cnt = 1;
        if (er.find(cur) != er.end()) cnt = er[cur].size();
        if (i == 0 && cur == '0') cnt = 0;
        ans *= cnt;
    }
    cout << ans;
}```
2025/7/31 23:20
加载中...