这道题本质是求C(n,m)组合数。(n>m)
行行列列互斥,所以只能放n个‘车’一行一个车,又因为规定只能左上右下,所以。。。
求组合数模板Com(n, m) (n>m)
#include <bits/stdc++.h>
using namespace std;
Combinatorial number model///
#define MOD 1000000007//必须为素数才管用
#define MAXN 1005
int n, m;
long long fac[MAXN];// n!
long long ifac[MAXN];//1/n!
long long QPow(long long x, long long n){
long long ret = 1;
long long tmp = x%MOD;
while(n){
if(n&1) ret = (ret*tmp) %MOD;
tmp = tmp*tmp%MOD;
n>>=1;
}
return ret;
}
void init(){
fac[0] = 1;
for(int i = 1; i<MAXN; i++)
fac[i] = fac[i-1]*i%MOD;
ifac[MAXN-1] = QPow(fac[MAXN - 1], MOD - 2);
for(int i = MAXN - 2; i >= 0; i--)
ifac[i] = ifac[i+1]*(i+1)%MOD;
}
long long Com(long long a, long long b){
if(b>a) return 0;
if(b==0) return 1;
return fac[a]*ifac[b]%MOD*ifac[a-b]%MOD;
}
///
int main(int argc, char const *argv[])
{
init();
int t;scanf("%d", &t);
while(t--){
scanf("%d%d", &n, &m);
if(n == m) printf("1\n");
else printf("%lld\n", Com( max(m, n), min(m,n) ) );
}
return 0;
}