FZU - 2020 组合 （组合数模板

$1<= n <=10^9$ $1<= m <=10^4$ $m < p < 10^9$

$p > 10^6$直接上朴素的模板即可， 不能无脑上$Lucas$

#include <iostream>
#include <algorithm>

using namespace std;

#define ll long long
#define pb push_back
#define ls o<<1
#define rs o<<1|1
#define fi first
#define se second
#define pii pair<int ,int>
#define pll pair<ll, ll>
#define CLR(a, b) memset(a, (b), sizeof(a))
const int INF = 0x3f3f3f3f;
const ll INFLL = ~0ull>>1;
const int mod = 1e9+7;
const int MAXN = (int)3e3+10;

void F() {
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif
}
ll ex_gcd(ll a, ll b, ll &x, ll &y) {
    if(b == 0) { x = 1, y = 0; return a; }
    ll d = ex_gcd(b, a%b, x, y);
    ll t = y;
    y = x-(a/b)*y;
    x = t;
    return d;
}
ll inv(ll n, ll p) {
    ll x, y;
    ex_gcd(n, p, x, y);
    return (x%p+p)%p;                 // exgcd得到的可能为负数
}
// ll pow_mod(ll a, ll b, ll p) {
//     ll res = 1;
//     while(b) {
//         if(b&1) res = res*a%p;
//         a = a*a%p;
//         b >>= 1;
//     }
//     return res;
// }
// ll inv(ll n, ll p) {
//     return pow_mod(n, p-2, p);
// }
ll C(ll n, ll m, ll p) {
    ll ans = 1;
    for(ll i = 1; i <= m; ++i) 
        ans = ans*(n-i+1)%p*inv(i, p)%p;
    return ans;
}
int main() {
    F();
    int T; cin >> T;
    while(T--) {
        ll n, m, p;
        cin >> n >> m >> p;
        cout << C(n, m, p) << endl;;
    }
    return 0;
}