P1869 愚蠢的组合数 卢卡斯定理

传送门

#include<cstdio>
typedef long long ll;
ll fact(int n, ll p){//n的阶乘求余p 
    ll ret = 1;
    for (int i = 1; i <= n ; i ++) ret = ret * i % p ;
    return ret ;
}
void ex_gcd(ll a, ll b, ll &x, ll &y, ll &d){
    if (!b) {d = a, x = 1, y = 0;}
    else{
        ex_gcd(b, a % b, y, x, d);
        y -= x * (a / b);
    }
}
ll inv(ll t, ll p){//如果不存在，返回-1 
    ll d, x, y;
    ex_gcd(t, p, x, y, d);
    return d == 1 ? (x % p + p) % p : -1;
}
ll comb(int n, int m, ll p){//C(n, m) % p
    if (m < 0 || m > n) return 0;
    return fact(n, p) * inv(fact(m, p), p) % p * inv(fact(n-m, p), p) % p;
}
ll Lucas(ll n, ll m, int p){
        return m ? Lucas(n/p, m/p, p) * comb(n%p, m%p, p) % p : 1;
}
int main(){
    int T, k;
    ll n, m;
    scanf("%d", &T);
    while(T--){
        scanf("%lld%lld", &n, &m);
        printf("%lld\n", Lucas(n, m,2));
    }
}

这个板子更快！！！！

#include<cstdio>
typedef long long ll;
ll quick_mod(ll a, ll b, ll c)  
{
	ll ans = 1;
	while (b)
	{
		if (b % 2 == 1)
			ans = (ans*a) % c;
		b /= 2;
		a = (a*a) % c;
	}
	return ans;
}
ll comb(ll n, ll k,ll p) {
	if (n < k)
		return 0;
	if (k > n - k)
		k = n - k;
	ll a = 1, b = 1;
	for (int i = 0; i < k; i++) 
	{
		a = a * (n - i) % p;
		b = b * (i + 1) % p;
	}
	return a * quick_mod(b, p - 2,p) % p;
}
ll Lucas(ll n, ll m, int p){
        return m ? Lucas(n/p, m/p, p) * comb(n%p, m%p, p) % p : 1;
}
int main(){
    int T, k;
    ll n, m;
    scanf("%d", &T);
    while(T--){
        scanf("%lld%lld", &n, &m);
        printf("%lld\n", Lucas(n, m,2));
    }
}