高精度乘法

#include<bits/stdc++.h>
using namespace std;
vector<int> v[10001];
vector<int> mul(vector<int> a,int b)
{
    vector<int> c;
    int t=0;
    for(int i=0;i<a.size();i++)
    {
        t+=a[i]*b;
        c.push_back(t%10);
        t=t/10;
    }
    while(t)
    {
        c.push_back(t%10);
        t=t/10;
    }
    return c;
}
int main()
{
    v[0].push_back(1);
    v[1].push_back(1);
   for(int i=2;i<=1000;i++)
   v[i]=mul(v[i-1],i);
   int dis;
   while(cin>>dis)
   {
       for(int i=v[dis].size()-1;i>=0;i--)
       cout<<v[dis][i];
       cout<<endl;
   }
   return 0;
}

使用于高精度与int/long long乘积 ACWING
https://www.acwing.com/problem/content/description/3392/

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

string bigNumberMultiply(string num1, string num2) {
    if (num1 == "0" || num2 == "0") return "0";

    int len1 = num1.size(), len2 = num2.size();
    vector<int> result(len1 + len2, 0);

    reverse(num1.begin(), num1.end());
    reverse(num2.begin(), num2.end());

    for (int i = 0; i < len1; ++i) {
        for (int j = 0; j < len2; ++j) {
            result[i + j] += (num1[i] - '0') * (num2[j] - '0');
            result[i + j + 1] += result[i + j] / 10;
            result[i + j] %= 10;
        }
    }

    while (result.size() > 1 && result.back() == 0) {
        result.pop_back();
    }

    string resStr;
    for (int i = result.size() - 1; i >= 0; --i) {
        resStr.push_back(result[i] + '0');
    }

    return resStr;
}

int main() {
    string num;
    cin >> num;

    string squaredNumber = bigNumberMultiply(num, num);
    cout<< squaredNumber << endl;

    return 0;
}

高精度乘法适用于所有