vector（高精度）阶乘(n<=10000,3s)

#include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
vector<int>mul(vector<int>&a,int b){
    cout<<"b: "<<b<<endl;
    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;
}//阶乘
int main()
{
    int n;
    while(cin>>n)
    {
        vector<int>a,c;
        a.pb(1);
        for(int i=1;i<=n;i++){
            c=mul(a,i);
            a=c;
        }
        for(int i=a.size()-1;i>=0;i--){
            cout<<a[i];
        }
        cout<<endl;
    }
}