进阶 Day 3
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
int qmi(int a, int k, int b)
{
int res = 1;
while (k)
{
if (k & 1)
res = (LL)res * a % b;
k >>= 1;
a = (LL)a * a % b;
}
return res;
} //qmi
int C(int a, int b, int p)
{
int res = 1;
for (int i = 1, j = a; i <= b; i++, j--)
{
res = (LL)res * j % p;
res = (LL)res * qmi(i, p - 2, p) % p;
}
return res;
} //C
int lucas(LL a, LL b, int p)
{
if (a < p && b < p)
return C(a, b, p);
return (LL)C(a % p, b % p, p) * lucas(a / p, b / p, p) % p;
} //lucas
int main(void)
{
int n;
scanf("%d", &n);
while (n--)
{
LL a, b;
int p;
scanf("%lld%lld%d", &a, &b, &p);
int res = lucas(a, b, p);
printf("%d\n", res);
}
return 0;
}