逆元求组合数 费马小定理版

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IO ios::sync_with_stdio(false);cin.tie(0);
const int maxn=1e6+5;
const ll mod=1e9+7;
ll n,m,q,ans;
ll cnt;
ll pre[maxn],ni[maxn];
ll ksm(ll a,ll b)  
{  
    ll res=1;
    while(b){
    	if(b&1){
    		res=res*a%mod;
		}
		a=a*a%mod;
		b>>=1;
	}
	return res;
}  

void s(){
	pre[0]=1;
	ni[0]=1;
	for(int i=1;i<=maxn;i++){
		pre[i]=pre[i-1]*i%mod;	//阶乘 
		ni[i]=ksm(pre[i],mod-2);	//逆元的阶乘 
	}
}
int main(){
	s();
	
	scanf("%lld",&q);
	while(q--){
		ans=0;
		scanf("%lld %lld",&n,&m);
		ans=((pre[n]*ni[m]%mod)*ni[n-m])%mod;
		cout<<ans<<endl;
	}
}

#include<bits/stdc++.h>
#include<string>
using namespace std;
typedef long long ll;
const int maxn=1e6+5;
const ll MOD=1e9+7;
const int INF=0x3f3f3f3f;
#define pb push_back
#define IO ios::sync_with_stdio(false);cin.tie(0);
int F[maxn], Finv[maxn], inv[maxn];//F是阶乘，Finv是逆元的阶乘 
ll T,n,m;
void init(){
    inv[1] = 1;
    for(int i = 2; i < maxn; i ++){
        inv[i] = (MOD - MOD / i) * 1ll * inv[MOD % i] % MOD;
    }
    F[0] = Finv[0] = 1;
    for(int i = 1; i < maxn; i ++){
        F[i] = F[i-1] * 1ll * i % MOD;
        Finv[i] = Finv[i-1] * 1ll * inv[i] % MOD;
    }
}
int comb(int n, int m){//comb(n, m)就是C(n, m) 
    if(m < 0 || m > n) return 0;
    return F[n] * 1ll * Finv[n - m] % MOD * Finv[m] % MOD;
}
int main(){
    init();
    cin>>T;
    while(T--){
    	cin>>n>>m;
    	cout<<comb(n,m)<<endl;
	}
}