hdu 5446 Unknown Treasure（Lucas定理+中国剩余定理）

题意：

求$C(n, m) \% (∏p_i)$。$p_i$小于$10^5$，$m$，$n$，以及答案都是$10^{18}$。

解析：

先使用$Lucas$定理求出对于每个$p_i$，$C(n, m) \% p_i$的值。
再使用中国剩余定理对模数和余数求解即可。

证明：

令 $total = ∏p_i$，$X = C_n^m \% (∏p_i)$，$k = \lfloor{C_n^m / total}\rfloor$

那么$C_n^m = k * total + X$
两边同对$p_i$取模，
$C_n^m \% p_i= (k * total + X) \% p_i = X \% p_i$

$$\left\{ \begin{aligned} X \% p_1 = C_n^m \% p_1 = Lucas(n,m,p_1)\\ X \% p_2 = C_n^m \% p_2 = Lucas(n,m,p_2)\\ ...\\ X \% p_n = C_n^m \% p_n = Lucas(n,m,p_n)\\ \end{aligned} \right.$$

那么对于后面的方程组，可以用中国剩余定理算出$X$，这就是最终答案。

$my$ $code$

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;  
typedef __int64 ll;
const int N = 100005;

ll fac[N];

ll modpow(ll a, ll b, ll MOD) {
    ll ret = 1;
    while(b) {
        if(b & 1) ret = (ret * a)%MOD;
        a = (a * a)%MOD;
        b >>= 1;
    }
    return ret;
}

ll modmul(ll a, ll b, ll MOD) {
    ll ret = 0;
    while(b) {
        if(b & 1) ret = (ret + a) % MOD;
        a = (a + a) % MOD;
        b >>= 1;
    }
    return ret;
}

ll getFactor(ll p) {
    fac[0] = 1;
    for(int i = 1; i <= p; i++)
        fac[i] = (fac[i-1]*i) % p;
}

ll Lucas(ll n, ll m, ll p) {  
    ll ret=1;
    while(n && m) {
        ll a = n%p, b = m%p;
        if(a<b) return 0; 
        ret = (ret * fac[a] * modpow(fac[b]*fac[a-b]%p, p-2, p)) % p;
        n/=p;
        m/=p;
    }
    return ret;  
}  

ll exgcd (ll a, ll b, ll &x, ll &y) {
    if (!b) {
        x = 1, y = 0;
        return a;
    }
    int ans = exgcd ( b , a % b , y , x );
    y -= a / b * x;
    return ans;
}

//中国剩余定理，a[i]存放余数，m[i]存放两两互质的数
ll remainder(ll a[], ll m[], int len) {
    ll d, x, y, ret = 0;
    ll M = 1;
    for (int i = 0; i < len; i++) M *= m[i];
    for (int i = 0; i < len; i++) {
        ll w = M / m[i];
        d = exgcd(m[i], w, x, y);
        ret = (ret + modmul(modmul(y, w, M), a[i], M) ) % M;
    }
    return (ret + M) % M;
}

ll n, m;
int K;
ll p[15], lucas[15];

int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        scanf("%I64d%I64d%d", &n, &m, &K);
        for(int i = 0; i < K; i++) {
            scanf("%I64d", &p[i]);
            getFactor(p[i]);
            lucas[i] = Lucas(n, m, p[i]);
        }
        ll ans = remainder(lucas, p, K);
        printf("%I64d\n", ans);
    }
    return 0;
}