Chess
Accepts: 1805
Submissions: 5738
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 32768/32768 K (Java/Others)
思路:
很显然,如果上边的点都在右边的话,我们最多可以放置的点的个数就是min(n,m),那么我们可供选择的(行/列)位子有max(n,m)个。
那么答案就是C(max(n,m),min(n,m));
需要取模,预处理Cnm就行了。
Ac代码:
#include<bits/stdc++.h>
using namespace std;
#define LL long long int
const LL mod = 1000000007;
const LL N = 300000+5;
const LL M = 3e5+3;
LL fac[1000005]; //阶乘
LL inv_of_fac[1000005]; //阶乘的逆元
LL qpow(LL x,LL n)
{
LL ret=1;
for(; n; n>>=1)
{
if(n&1) ret=ret*x%mod;
x=x*x%mod;
}
return ret;
}
void init()
{
fac[1]=1;
for(int i=2; i<=M; i++)
fac[i]=fac[i-1]*i%mod;
inv_of_fac[M]=qpow(fac[M],mod-2);
for(int i=M-1; i>=0; i--)
inv_of_fac[i]=inv_of_fac[i+1]*(i+1)%mod;
}
LL C(LL a,LL b)
{
if(b>a) return 0;
if(b==0) return 1;
return fac[a]*inv_of_fac[b]%mod*inv_of_fac[a-b]%mod;
}
int main()
{
init();
int t;
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d%d",&n,&m);
printf("%I64d\n",C(max(n,m),min(n,m)));
}
}