【高精度】阶乘数码——洛谷1591

#include <iostream>
#include <vector>

using namespace std;

vector<int> mul(vector<int> &A, int b)
{
    vector<int> C;
    int t = 0;
    for (int i = 0; i < A.size() || t; i ++ ) 
    {
        if (i < A.size()) t += A[i] * b;
        C.push_back(t % 10);
        t /= 10;
    }
    while (C.size() > 1 && C.back() == 0) C.pop_back();

    return C;
}

vector<int> get(int n)
{
    vector<int> q(1, 1);
    for (int i = 1; i <= n; i ++ )
        q = mul(q, i);
    return q;
}

int main()
{
    int T;
    cin >> T;
    while (T -- )
    {
        int n, x;
        cin >> n >> x;

        vector<int> C = get(n);

        int res = 0;
        for (auto c: C)
            res += c == x;
        cout << res << endl;
    }
    return 0;
}