[技巧]高精度

//高精度乘法
string mul(string a,string b)
{
    string s;
    int na[maxn]={},nb[maxn]={},nc[maxn]={},La=a.size(),Lb=b.size();
    for(int i=La-1;i>=0;i--) na[La-i]=a[i]-'0';
    for(int i=Lb-1;i>=0;i--) nb[Lb-i]=b[i]-'0';
    for(int i=1;i<=La;i++)
        for(int j=1;j<=Lb;j++)
        nc[i+j-1]+=na[i]*nb[j];
    for(int i=1;i<=La+Lb;i++)
        nc[i+1]+=nc[i]/10,nc[i]%=10;
    if(nc[La+Lb]) s+=nc[La+Lb]+'0';
    for(int i=La+Lb-1;i>=1;i--)
        s+=nc[i]+'0';
    return s == string(La+Lb-1, '0') ? "0" : s;
}
//高精度浮点数乘法
int main()
{
    int n;
    string s;
    cin >> s >> n;

    int dot = 0, status = 0, l = s.size();
    string::iterator it = s.begin();
    while (it != s.end()){
        if (*it != '.') ++it, ++dot;
        else break;
    }
    if (it != s.end()) s.erase(it);
    else status = 1;

    if (s[0] == '0'){
        status = -1;
        while (s[0] == '0') s.erase(s.begin());
    }

    if (s.size() == 0) return 0 & puts("0");
   
    string ans("1");
    for (int i = 0; i < n; ++i) ans = mul(ans, s);

    int zn = (l - 1 - dot) * n;
    if (status == 0){
        ans.insert(ans.size() - zn, 1, '.');
    }else if (status == -1){
        zn -= ans.size();
        ans.insert(ans.begin(), zn, '0');
        ans.insert(ans.begin(), 1, '.');
    }

    if (status != 1){
        while (ans[ans.size() - 1] == '0') ans.erase(ans.end() - 1);
    }

    if (ans[ans.size() - 1] == '.') ans.erase(ans.end() - 1);

    cout << ans << endl;
    return 0;
}
//高精度加法
string add(string a,string b)//只限两个非负整数相加
{
    string ans;
    int na[maxn]={0},nb[maxn]={0};
    int la=a.size(),lb=b.size();
    for(int i=0;i<la;i++) na[la-1-i]=a[i]-'0';
    for(int i=0;i<lb;i++) nb[lb-1-i]=b[i]-'0';
    int lmax=la>lb?la:lb;
    for(int i=0;i<lmax;i++) na[i]+=nb[i],na[i+1]+=na[i]/10,na[i]%=10;
    if(na[lmax]) lmax++;
    for(int i=lmax-1;i>=0;i--) ans+=na[i]+'0';
    return ans;
}
//高精度减法
string sub(string a,string b)
{
    string ans;
    int na[maxn]={0},nb[maxn]={0};
    int la=a.size(),lb=b.size();
    for(int i=0;i<la;i++) na[la-1-i]=a[i]-'0';
    for(int i=0;i<lb;i++) nb[lb-1-i]=b[i]-'0';
    int lmax=la>lb?la:lb;
    for(int i=0;i<lmax;i++)
    {
        na[i]-=nb[i];
        if(na[i]<0) na[i]+=10,na[i+1]--;
    }
    while(!na[--lmax]&&lmax>0)  ;lmax++;
    for(int i=lmax-1;i>=0;i--) ans+=na[i]+'0';
    return ans;
}
//高精度快速幂
string quickpow(string a, int k)
{
    string res = "1";
    while (k){
        if (k & 1) res = mul(res, a);
        a = mul(a, a);
        k >>= 1;
    }
    return res;
}
//高精度max
string max(string a, string b) {
    if (a.size() > b.size()) return a;
    if (a.size() < b.size()) return b;
    for (int i = 0; i < a.size(); ++i) {
        if (a[i] > b[i]) return a;
        if (a[i] < b[i]) return b;
    }
    return a;
}
int main()
{
    bool neg = 0;
    string a,b;
    cin>>a>>b;
    if (b.size() > a.size() || (b.size() == a.size() && b > a)) swap(a, b), neg = 1;
    cout<<(neg ? "-" : "")<<sub(a,b)<<endl;
    return 0;
}
//正负以及加减合并
int main()
{
    string a, b;
    cin >> a >> b;
    if (a[0] == '-' && b[0] == '-') cout << "-" << add(a.substr(1), b.substr(1));
    else if (a[0] == '-'){
        if (a.size() - 1 > b.size() || (a.size() - 1 == b.size() && a.substr(1) > b)) cout << "-" << sub(a.substr(1), b) << endl;
        else cout << sub(b, a.substr(1)) << endl;
    }else if (b[0] == '-'){
        if (b.size() - 1 > a.size() || (b.size() - 1 == a.size() && b.substr(1) > a)) cout << "-" << sub(b.substr(1), a) << endl;
        else cout << sub(a, b.substr(1)) << endl;
    }else cout << add(a, b) << endl;
    return 0;
}
//高精度阶乘
int main()
{
    int n;
    cin >> n;
    string ans("1");
    for (int i = 2; i <= n; ++i) ans = mul(ans, to_string(i));
    cout << ans << endl;
    return 0;
}
//高精度快速阶乘/大数乘小数
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll L = 1e14;
ll ans[10005] = {1};
int main()
{
    int n, p = 0;
    cin >> n;
    for (int i = 2; i <= n; ++i){
        ll c = 0;
        for (int j = 0; j <= p; ++j){
            ll t = ans[j] * i + c;
            ans[j] = t % L;
            c = t / L;
        }
        if (c != 0) ans[++p] = c;
    }
    printf("%lld", ans[p]);
    for (int i = p - 1; i >= 0; --i) printf(i == 0 ? "%0.14lld\n" : "%0.14lld", ans[i]);
    return 0;
}
//高精度极速阶乘（不会，先放着）