有幸帮同机房巨佬求助 @Live

这事那位巨佬的代码，求调，感谢：

#include<iostream>
#include<cstdio>
#define ll long long
using namespace std;
const int maxn=1e5+10;
template <class T>
inline void read(T &x)
{
    char ch=getchar();
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
}
ll a[maxn];
ll inv(ll x,int p)
{
    if(x<=1)return 1;
    return (p-p/x)*inv(p%x,p)%p;
}
ll C(int n,int m,int p)
{
    if(m>n)return 0;
    return a[n]*inv(a[m],p)%p*inv(a[n-m],p)%p;
}
ll Lucas(int n,int m,int p)
{
    if(!m)return 1;
    return C(n%p,m%p,p)*Lucas(n/p,m/p,p)%p;
}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int n,m,p;
        read(n),read(m),read(p);
        a[0]=1;
        for(int i=1;i<=p;i++)
            a[i]=(a[i-1]*i)%p;
        printf("%lld\n",Lucas(n+m,n,p));
    }
    return 0;
}