牛客 - Walk | 求组合数

描述

求矩阵中从(1,1)到(n,m)有多少个最短路径。$n,m<=1e6$

路径过程中有n-1次向下，m-1次向右，答案就是$C(n+m-2,n-1)$
求组合数，可以根据$C(n,m)=C(n-1,m-1)+C(n-1,m)$打表，$O(n^2)$；可以用定义$C(n,m)=\frac{n!}{(n-m)!\ast m!}$求，$O(n)$
需要求逆元，若mod p，p为质数，则由$a^{p-1}\equiv 1(modp)$可知$a\ast a^{p-2}\equiv 1(modp)$。

代码

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<vector>
#define cl (k<<1)
#define cr (k<<1|1)
#define Mid ((a[k].l+a[k].r)>>1)
#define mem(a,x) memset(a,x,sizeof(a))
using namespace std;
#define bug printf("???\n")

typedef long long LL;

const int Inf=0x3f3f3f3f;
const double eps=1e-7;
const int maxn=2e6+5;
const LL mod=1000000007;

LL Pow(LL a,LL b){
    LL ret=1;
    while(b){
        if(b&1) ret = (ret*a)%mod;
        a = (a*a)%mod;
        b = b>>1;
    }
    return ret;
}
LL jie[maxn];

int main()
{
    jie[0] = 1;
    for(LL i=1; i<=2e6; i++)
        jie[i] = (jie[i-1]*i) % mod;
    
    int T;
    cin>>T;
    while(T--){
        LL n,m;
        cin>>n>>m;
        LL up, down;   
        up = jie[n+m-2];
        down = jie[n-1]*jie[m-1]%mod;
        printf("%lld\n",up*Pow(down,mod-2)%mod);
        // printf("%lld\n",up/down );
    }
}