由于n的值较小(10^6以内),mod = 1000003,使用乘法逆元和阶乘预处理即可。
c(m,n) = m!/(n!*(m-n)!)
对阶乘进行求模预处理,对分母求其乘法逆元,将得到的乘法逆元与分子相乘求模即可
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int const mod = 1000003;
long long jie[1000001];
void init()
{
jie[0] = 1;
for(int i = 1;i<1000001;i++)
{
jie[i] = jie[i-1]*i%mod;
}
}
int extendGcd(int m,int n,int &x,int &y)
{
if(n==0)
{
x = 1;
y = 0;
return m;
}
int c = extendGcd(n,m%n,x,y);
int temp = x;
x = y;
y = temp - m/n*y;
return c;
}
int main()
{
init();
int n,p,q,x,y;
long long ans;
scanf("%d",&n);
for(int i = 1;i<=n;i++)
{
scanf("%d %d",&p,&q);
ans = 1;
if(q==0||q==p)
{
printf("Case %d: 1\n",i);
continue;
}
extendGcd(mod,jie[q]*jie[p-q]%mod,x,y);
while(y<0)
{
y += mod;
}
ans = jie[p]*y%mod;
printf("Case %d: %lld\n",i,ans);
}
return 0;
}