高精度模板

加法

string add(string st1, string st2) {
	string c;
	int ans[5005] = {}, a[5005] = {}, b[5005] = {};
	int n1 = st1.size();
	int n2 = st2.size();
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n2; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	int n3 = 1;
	while (n3 <= n1 || n3 <= n2) {
		ans[n3] += a[n3] + b[n3];
		ans[n3 + 1] = ans[n3] / 10;
		ans[n3] %= 10;
		n3++;
 	}
 	if (ans[n3] == 0) n3--;
 	for (int i = n3; i >= 1; i--) {
 		c += ans[i] + '0';
	}
	return c;
}

减法

string sub(string st1, string st2) {
	string c;
	int ans[5005] = {}, a[5005] = {}, b[5005] = {};
	int n1 = st1.size();
	int n2 = st2.size();
	if (n1 < n2) {
		cout << "-";
		swap(st1, st2);
		swap(n1, n2);
	} else if (n1 == n2) {
		if (st1 < st2) {
			cout << "-";
			swap(st1, st2);
		}
	}
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n2; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	int n3 = 1;
	while (n3 <= n1 || n3 <= n2) {
		ans[n3] += a[n3] - b[n3];
		if (ans[n3] < 0) {
			ans[n3 + 1]--;
			ans[n3] += 10;
		}
		n3++;
 	}
 	while (ans[n3] == 0 && n3 != 1) n3--;
 	for (int i = n3; i >= 1; i--) {
 		c += ans[i] + '0';
	}
	return c;
}

乘法

string mul(string st1, string st2) {
	string c;
	int ans[20005] = {}, a[10005] = {}, b[10005] = {};
	int n1 = st1.size(), n2 = st2.size();
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n2; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	for (int i = 1; i <= n1; i++) {
        for (int j = 1; j <= n2; j++) {
            ans[i + j - 1] += a[i] * b[j];
            ans[i + j] += ans[i + j - 1] / 10;
            ans[i + j - 1] %= 10;
        }
    }
    int n3 = n1 + n2;
    while (ans[n3] == 0 && n3 != 1) n3--;
    for (int i = n3; i >= 1; i--) {
    	c += ans[i] + '0';
	}
    return c;
}

高精度阶乘

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
string mul(string st1, string st2) {
	string c;
	int ans[20005] = {}, a[10005] = {}, b[10005] = {};
	int n1 = st1.size(), n2 = st2.size();
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n1; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	for (int i = 1; i <= n1; i++) {
        for (int j = 1; j <= n2; j++) {
            ans[i + j - 1] += a[i] * b[j];
            ans[i + j] += ans[i + j - 1] / 10;
            ans[i + j - 1] %= 10;
        }
    }
    int n3 = n1 + n2;
    while (ans[n3] == 0 && n3 != 1) n3--;
    for (int i = n3; i >= 1; i--) {
    	c += ans[i] + '0';
	}
    return c;
}
int main() {
	int n;
	cin >> n;
	string p;
	p += '1';
	for (int i = 1; i <= n; i++) {
		string a, b;
		int t = i, tot = 0;
		while (t != 0) {
			a += (t % 10 + '0');
			tot++;
			t /= 10;
		}
		for (int i = tot - 1; i >= 0; i--) {
			b += a[i];
		}
		//cout << b << endl;
		p = mul(p, b);
		//cout << p << endl;
	}
	cout << p;
    return 0;
}

高精度阶乘和

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
string sum[1005];
string mul(string st1, string st2) {
	string c;
	int ans[200005] = {}, a[100005] = {}, b[100005] = {};
	int n1 = st1.size(), n2 = st2.size();
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n1; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	for (int i = 1; i <= n1; i++) {
        for (int j = 1; j <= n2; j++) {
            ans[i + j - 1] += a[i] * b[j];
            ans[i + j] += ans[i + j - 1] / 10;
            ans[i + j - 1] %= 10;
        }
    }
    int n3 = n1 + n2;
    while (ans[n3] == 0 && n3 != 1) n3--;
    for (int i = n3; i >= 1; i--) {
    	c += ans[i] + '0';
	}
    return c;
}
string add(string st1, string st2) {
	string c;
	int ans[500005] = {}, a[500005] = {}, b[500005] = {};
	int n1 = st1.size();
	int n2 = st2.size();
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n2; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	int n3 = 1;
	while (n3 <= n1 || n3 <= n2) {
		ans[n3] += a[n3] + b[n3];
		ans[n3 + 1] = ans[n3] / 10;
		ans[n3] %= 10;
		n3++;
 	}
 	if (ans[n3] == 0) n3--;
 	for (int i = n3; i >= 1; i--) {
 		c += ans[i] + '0';
	}
	return c;
}
int main() {
	int n;
	cin >> n;
	string p;
	p += '1';
	for (int i = 1; i <= n; i++) {
		string a, b;
		int t = i, tot = 0;
		while (t != 0) {
			a += (t % 10 + '0');
			tot++;
			t /= 10;
		}
		for (int j = tot - 1; j >= 0; j--) {
			b += a[j];
		}
		p = mul(p, b);
		sum[i] = p;
	}
	string k;
	k += '0';
	for (int i = 1; i <= n; i++) {
		k = add(k, sum[i]);
	}
	cout << k;
    return 0;
}

高精快速幂

#include <bits/stdc++.h>
#define ll long long
using namespace std;
string mul(string st1, string st2) {
	string c;
	int ans[200005] = {}, a[100005] = {}, b[100005] = {};
	int n1 = st1.size(), n2 = st2.size();
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n2; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	for (int i = 1; i <= n1; i++) {
        for (int j = 1; j <= n2; j++) {
            ans[i + j - 1] += a[i] * b[j];
            ans[i + j] += ans[i + j - 1] / 10;
            ans[i + j - 1] %= 10;
        }
    }
    int n3 = n1 + n2;
    while (ans[n3] == 0 && n3 != 1) n3--;
    for (int i = n3; i >= 1; i--) {
    	c += ans[i] + '0';
	}
    return c;
}
string Pow(string x, ll n) {
	//cout << x << ' ' << n << endl;
    if (n == 0) {
    	string p;
    	p += '1';
    	return p;
	}
    string res = Pow(mul(x, x), n / 2);
    string ans = res;
    if (n & 1ll) {
    	//cout << res << ' ' << x <<  endl;
    	ans = mul(res, x);
    	//cout << ans << endl;
	}
    return ans;
}
int main() {
    string a;
    a += '2';
    ll n;
    cin >> n; 
    cout << Pow(a, n);
    return 0;
}

高精除低精

string div(string st1, int b) {
	string c;
	int ans[10005] = {}, a[5005] = {};
	int n1 = st1.size();
	for (int i = 0; i < n1; i++) {
		a[i + 1] = st1[i] - '0';
	}
	for (int i = 1; i <= n1; i++) {
        ans[i] = a[i] / b;
        a[i + 1] += (a[i] % b) * 10;
    }
    int n3 = 1;
    while (ans[n3] == 0 && n3 < n1) n3++;
    for (int i = n3; i <= n1; i++) {
    	c += ans[i] + '0';
	}
    return c;
}

高精除高精

Tips:需要高精度减法、乘法、加法

string add(string st1, string st2) {
	string c;
	int ans[5005] = {}, a[5005] = {}, b[5005] = {};
	int n1 = st1.size();
	int n2 = st2.size();
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n2; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	int n3 = 1;
	while (n3 <= n1 || n3 <= n2) {
		ans[n3] += a[n3] + b[n3];
		ans[n3 + 1] = ans[n3] / 10;
		ans[n3] %= 10;
		n3++;
 	}
 	if (ans[n3] == 0) n3--;
 	for (int i = n3; i >= 1; i--) {
 		c += ans[i] + '0';
	}
	return c;
}
string sub(string st1, string st2) {
    string c;
    int ans[5005] = {}, a[5005] = {}, b[5005] = {};
    int n1 = st1.size();
    int n2 = st2.size();
    if (n1 < n2) {
        c += '-';
        return c;
    } else if (n1 == n2) {
        if (st1 < st2) {
        	c += '-';
        	return c;
        }
    }
    for (int i = 0; i < n1; i++) {
        a[n1 - i] = st1[i] - '0';
    }
    for (int i = 0; i < n2; i++) {
        b[n2 - i] = st2[i] - '0';
    }
    int n3 = 1;
    while (n3 <= n1 || n3 <= n2) {
        ans[n3] += a[n3] - b[n3];
        if (ans[n3] < 0) {
            ans[n3 + 1]--;
            ans[n3] += 10;
        }
        n3++;
    }
    while (ans[n3] == 0 && n3 != 1) n3--;
    for (int i = n3; i >= 1; i--) {
        c += ans[i] + '0';
    }
    return c;
}
string mul(string st1, string st2) {
	string c;
	int ans[10005] = {}, a[5005] = {}, b[5005] = {};
	int n1 = st1.size(), n2 = st2.size();
	for (int i = 0; i < n1; i++) {
		a[n1 - i] = st1[i] - '0';
	}
	for (int i = 0; i < n2; i++) {
		b[n2 - i] = st2[i] - '0';
	}
	for (int i = 1; i <= n1; i++) {
        for (int j = 1; j <= n2; j++) {
            ans[i + j - 1] += a[i] * b[j];
            ans[i + j] += ans[i + j - 1] / 10;
            ans[i + j - 1] %= 10;
        }
    }
    int n3 = n1 + n2;
    while (ans[n3] == 0 && n3 != 1) n3--;
    for (int i = n3; i >= 1; i--) {
    	c += ans[i] + '0';
	}
    return c;
}
string div(string a1, string b1) {
	string c;
	int lena = a1.size(), lenb = b1.size(), ans[5005] = {};
	int a[5005] = {};
	for (int i = 0; i < lena; i++) {
		a[i + 1] = a1[i] - '0'; 
	}
	string x;
	for (int i = 1; i <= lena; i++) {
		int tot = 0;
		x += a[i] + '0';
		while (x.size() > lenb || (x.size() == lenb && x > b1)) {
			tot++;
			x = sub(x, b1);
		}
		ans[i] = tot;
	}
	int lenc = 1;
	while (ans[lenc] == 0 && lenc < lena) lenc++;
	for (int i = lenc; i <= lena; i++) {
		c += ans[i] + '0';
	}
	string z;
	z += '1';
	string p = mul(add(c, z), b1);
	//cout << a1 << ' ' << p << endl;
	if (p == a1) c = add(c, z);
	return c;
}