题目链接:FZU 2020 组合
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <cmath>
#include <ctime>
#include <cassert>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
typedef long long ll;
ll mod;
inline ll quick_pow(ll a, ll b)
{
ll res = 1, tmp = a;
while(b) {
if(b & 1) res = res * tmp % mod;
tmp = tmp * tmp % mod;
b >>= 1;
}
return res;
}
inline ll C(ll n, ll m)
{ //计算C[n][m] % mod
if(m > n) return 0;
ll res = 1, a, b;
for(int i = 1; i <= m; ++i) {
a = (n + i - m) % mod;
b = i % mod;
res = res * a % mod * quick_pow(b, mod - 2) % mod; //逆元
}
return res;
}
inline ll Lucas(ll n, ll m)
{
if(m == 0) return 1;
return C(n % mod, m % mod) * Lucas(n / mod, m / mod) % mod;
}
int main()
{
int T;
scanf("%d", &T);
while(T--) {
ll n, m;
scanf("%I64d%I64d%I64d", &n, &m, &mod);
printf("%I64d\n", Lucas(n, m));
}
return 0;
}