杂七杂八的一堆东西

#include<bits/stdc++.h>
#define N 100010
using namespace std;
typedef long long ll;
ll a[N];
int p;
ll pow(ll y,int z,int p){
    y%=p;ll ans=1;
    for(int i=z;i;i>>=1,y=y*y%p)if(i&1)ans=ans*y%p;
    return ans;
}
ll C(ll n,ll m){
    if(m>n)return 0;
    return ((a[n]*pow(a[m],p-2,p))%p*pow(a[n-m],p-2,p)%p);
}
ll Lucas(ll n,ll m){
    if(!m)return 1;
    return C(n%p,m%p)*Lucas(n/p,m/p)%p;
}
inline int read(){
    int f=1,x=0;char ch;
    do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
    do{x=x*10+ch-'0';ch=getchar();}while(ch>='0'&&ch<='9');
    return f*x;
}
int main(){
    int T=read();
    while(T--){
        int n=read(),m=read();p=read();
        a[0]=1;
        for(int i=1;i<=p;i++)a[i]=(a[i-1]*i)%p;
        cout<<Lucas(n+m,n)<<endl;
    }
}

#include<cstdio>
#include<vector>
using namespace std;
struct Matrix{
    vector<vector<int> > matrix;
    int r,c;
    Matrix(){r=-1,c=-1;}
    inline void input(int row,int col)
    {
        int t;
        matrix.resize(row);
        r=row,c=col;
        for(int i=0;i<r;i++)
            for(int j=0;j<c;j++)
            {
                scanf("%d",&t);
                matrix[i].push_back(t);
            }
    }
    inline void print(int r,int c)
    {
        for(int i=0;i<r;i++)
        {
            for(vector<int>::iterator it=matrix[i].begin();it!=matrix[i].end();++it)
                printf("%d ",*it);
            printf("\n");
        }
    }
    Matrix operator * (const Matrix& a)const
    {  
        Matrix ret; 
        if(this->c!=a.r&&this->r!=a.c)throw -1;
        ret.r=this->r,ret.c=a.c;
        ret.matrix.resize(ret.r);
        for(int i=0;i<ret.r;i++)
            for(int j=0;j<ret.c;j++)
            {
                ret.matrix[i].push_back(0);
                for(int k=0;k<this->c;k++)
                    ret.matrix[i][j]+=a.matrix[k][j]*this->matrix[i][k];
            }
        return ret;
    }
}a,b,res;
int r,c;
int main()
{
    scanf("%d%d",&r,&c);
    a.input(r,c);
    scanf("%d%d",&r,&c);
    b.input(r,c);
    try {res=a*b;}
    catch(...){printf("Unsupported Matrix.\n");return 0;}
    res.print(res.r,res.c);
    return 0;
}

 

#include<cstdio>
#include<vector>
using namespace std;
struct Matrix {
    vector<vector<long long> > matrix;
    int r,c;
    Matrix() {
        r=-1,c=-1;
    }
    inline void input(int row,int col) {
        int t;
        matrix.resize(row);
        r=row,c=col;
        for(int i=0; i<r; i++)
            for(int j=0; j<c; j++) {
                scanf("%d",&t);
                matrix[i].push_back(t);
            }
    }
    inline void print() {
        if(this->r<0||this->c<0){
            printf("Invalid Matrix, Maybe Syntax Error Had Happened?\n");
            return;
        }
        for(int i=0; i<this->r; i++) {
            for(vector<long long>::iterator it=matrix[i].begin(); it!=matrix[i].end(); ++it)
                printf("%I64d ",*it);
            printf("\n");
        }
    }
    Matrix operator + (const Matrix& a)const {
        Matrix ret;
        if(this->r!=a.r||this->c!=a.c)throw -1;
        ret.r=this->r,ret.c=this->c;
        ret.matrix.resize(ret.r);
        for(int i=0;i<ret.r;i++)
            for(int j=0;j<ret.c;j++)
                ret.matrix[i].push_back(a.matrix[i][j]+this->matrix[i][j]);
        return ret;
    }
    Matrix operator - (const Matrix& a)const {
        Matrix ret;
        if(this->r!=a.r||this->c!=a.c)throw -1;
        ret.r=this->r,ret.c=this->c;
        ret.matrix.resize(ret.r);
        for(int i=0;i<ret.r;i++)
            for(int j=0;j<ret.c;j++)
                ret.matrix[i].push_back(this->matrix[i][j]-a.matrix[i][j]);
        return ret;
    }
    Matrix operator * (const Matrix& a)const {
        Matrix ret;
        if(this->c!=a.r&&this->r!=a.c)return ret;
        ret.r=this->r,ret.c=a.c;
        ret.matrix.resize(ret.r);
        for(int i=0; i<ret.r; i++)
            for(int j=0; j<ret.c; j++) {
                ret.matrix[i].push_back(0);
                for(int k=0; k<this->c; k++)
                    ret.matrix[i][j]+=a.matrix[k][j]*this->matrix[i][k];
            }
        return ret;
    }
};