HDU 3037 Saving Beans （Lucas定理求大数组合数）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3037

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long  ll;
const int N = 150000;
ll n, m, p;
ll fac[N];
void init() {//预处理，很重要
	fac[0] = 1;
	for(int i = 1; i <= p; i++) {
		fac[i] = (fac[i-1]*i)%p;
	}
}
ll qpow(ll a, ll b) {
	ll res = 1;
	while(b) {
		if(b&1)
			res = res*a,res %= p;
		a *= a;
		a %= p;
		b >>= 1;
	}
	return res;
}
ll Cal(ll n, ll m) {
	if(m > n) return 0;
	return fac[n]*qpow(fac[m],p-2)%p*qpow(fac[n-m],p-2)%p;
}
ll Lucas(ll n, ll m) {
	if(m == 0) return 1;
	else return (Cal(n%p,m%p)*Lucas(n/p,m/p))%p;
}
int main() {
	int t;
	scanf("%d", &t);
	while(t--) {
		scanf("%lld %lld %lld", &n, &m, &p);
		init();
		printf("%lld\n", Lucas(n+m,m));
	}
}