求组合数2

题目：

#include<iostream>
using namespace std;
const int mod=1e9+7;
long long fac[100005],infac[100005];
int pow(int a, int k, int p)
{
    int res = 1;
    while (k)
    {
        if (k & 1) res = (long long)res * a % p;
        a = (long long)a * a % p;
        k >>= 1;
    }
    return res;
}
int main()
{
    int n;
    fac[0]=infac[0]=1;
    for(int i=1;i<=1e5;i++)
    {
        fac[i]=fac[i-1]*i%mod;
        infac[i]=(long long)infac[i - 1] * pow(i,mod-2,mod)%mod;
    }
    cin>>n;
    while(n--)
    {
        int a,b;
        cin>>a>>b;
        cout<<(long long)fac[a] * infac[b] % mod * infac[a - b] % mod<<endl;
    }
    
    return 0;
}