HDU 5446 Unknown Treasure

lucas定理求得C(n, m), 中国剩余定理求得X%（p1, p2, p3......pk)，过程中要用一个取余模板防止超出long long范围

#include <stdio.h>
#include <string.h>
#define ll long long
ll p;
ll P[15], A[15];
ll quickmod(ll m,ll n,ll k)
{
    ll b = 0;
    while (n > 0)
    {
          if (n & 1)
             b = (b+m)%k;
          n = n >> 1 ;
          m = (m+m)%k;
    }
    return b;
}
ll qpow(ll a,ll b)
{
    ll ans;
    for(ans=1;b;b>>=1,a=a*a%p)
        if(b&1)ans=quickmod(ans, a, p);
    return ans;
}
ll getc(ll n,ll m)
{
    if(n<m)return 0;
    if(m>n-m)m=n-m;
    ll s1=1,s2=1;
    for(ll i=0;i<m;i++)
    {
        s1=quickmod(s1, (n-i), p);
        s2=quickmod(s2, (i+1), p);
    }
    return quickmod(s1, qpow(s2,p-2), p);
}
ll lucas(ll n,ll m)
{
    if(m==0)return 1;
    return quickmod(getc(n%p,m%p), lucas(n/p,m/p), p);
}
// 扩展欧几里得
ll exgcd(ll a, ll b, ll &x, ll &y) {
    if(!b) {
        x = 1; y = 0;
        return a;
    }
    ll ret = exgcd(b, a%b, y, x);
    y -= a/b*x;
    return ret;
}

// 中国剩余定理
ll china(ll n, ll a[], ll m[]) {
    ll M = 1;
    for(ll i = 0;i < n; i++) M *= m[i];
    ll ret = 0;
    for(ll i = 0;i < n; i++) {
        ll w = M/m[i], x, y;
        ll d = exgcd(m[i], w, x, y);
        ret = (ret%M + quickmod(quickmod(y, w, M), a[i], M));
    }
    return (ret%M + M)%M;
}
int main()
{
    ll t, k, i, n, m;
    scanf("%I64d", &t);
    while(t--)
    {
        scanf("%I64d %I64d %I64d", &n, &m, &k);
        for(i = 0;i < k;i++) {
                scanf("%I64d", &p);
                P[i] = p;
                A[i] = lucas(n, m);
        }
        ll ans = china(k, A, P);
        printf("%I64d\n", ans);
    }
}