高精度求组合数

C(50,100)是30位

C(500,1000)是300位

C(5000,10000)是3009位

因此,单纯的求组合数需要用到高精度

#include<bits/stdc++.h>
#define endl '\n'
#define int int64_t
using namespace std;
const int N = 1e5 + 10;
int prime[N], cnt, vis[N];
void init() {
	for (int i = 2; i < N; ++i) {
		if (!vis[i]) prime[cnt++] = i;
		for (int j = 0; i * prime[j] < N; ++j) {
			vis[i * prime[j]] = 1;
			if (i % prime[j] == 0) break;
		}
	}
}
int get(int n, int p) {// n!中p的个数
	int tot = 0;
	while (n) tot += n / p, n /= p;
	return tot;
}
int getc(int n, int m, int p) {//c中p的个数
	return get(n, p) - get(n - m, p) - get(m, p);
}
void mul(int c[], int p, int& len) {//高精度
	int t = 0;
	for (int i = 0; i < len; ++i) {
		t += c[i] * p;
		c[i] = t % 10;
		t /= 10;
	}
	while (t) {
		c[len++] = t % 10;
		t /= 10;
	}
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	init();
	int* c = new int[N];
	int n, m;
		int len = 1; c[0] = 1;
		for (int i = 0; i < cnt  ; ++i) {
			int p = prime[i];
			int s = getc(n, m, p);
			while (s--) mul(c, p, len);
		}
	return 0;
}