Lucas定理

• 模数为质数时成立 

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
int fact[100010],T,n,m,p;
inline int read(){
	int num=0;char ch=getchar();
	while(!isdigit(ch))ch=getchar();
	while(isdigit(ch))num=num*10+ch-'0',ch=getchar();
	return num;
}
inline void Print(int x){if(x>9)Print(x/10);putchar(x%10+'0');}
int power(int a,int b){
	int ans=1;for(;b;b>>=1,a=1LL*a*a%p)if(b&1)ans=1LL*ans*a%p;return ans;
}
int C(int n,int m){
	if(m>n)return 0;
	return 1LL*fact[n]*power(fact[m],p-2)%p*power(fact[n-m],p-2)%p;
}
int lucas(int n,int m){
	if(!m)return 1;
	return 1LL*lucas(n/p,m/p)*C(n%p,m%p)%p;
}
int main()
{
	//freopen("a.in","r",stdin);
	T=read();
	while(T--){
		n=read(),m=read(),p=read();
		fact[0]=1;rep(i,1,n+m)fact[i]=1LL*i*fact[i-1]%p;
		Print(lucas(n+m,m));puts("");
	}return 0;
}