Description
Given n different objects, you want to take k of them. How many ways to can do it?
For example, say there are 4 items; you want to take 2 of them. So, you can do it 6 ways.
Take 1, 2
Take 1, 3
Take 1, 4
Take 2, 3
Take 2, 4
Take 3, 4
Input
Input starts with an integer T (≤ 2000), denoting the number of test cases.
Each test case contains two integers n (1 ≤ n ≤ 106), k (0 ≤ k ≤ n).
Output
For each case, output the case number and the desired value. Since the result can be very large, you have to print the result modulo 1000003.
Sample Input
3
4 2
5 0
6 4
Sample Output
Case 1: 6
Case 2: 1
Case 3: 15
乘法逆元:
#include<stdio.h>
#include<algorithm>
using namespace std;
#define ll long long
ll f[1000010],a[1000010],k=1000003,i,j,x,y;
long long exgcd(long long a,long long b,ll&x,ll &y)//扩展欧几里得求逆元
{
if(b==0)
{
x=1;
y=0;
return a;
}
else
{ll gcd=exgcd(b,a%b,x,y);
ll temp=x;
x=y;
y=temp-a/b*y;
return gcd;
}
}
ll init()
{a[0]=1;
f[0]=1;
for(i=1;i<=1000000;i++)
{a[i]=a[i-1]*i%k;
exgcd(a[i],k,x,y);
f[i]=(x%k+k)%k;//求逆元
//printf("%lld %lld\n",a[i],f[i]);
}
}
int main()
{
init();
//printf("%d ",a[i]);
int t;
int cnt=0;
scanf("%d\n",&t);
int a1,b1;
while(t--)
{
scanf("%d%d",&a1,&b1);
long long ans=a[a1]*f[b1]%k*f[a1-b1]%k;
printf("Case %d: %lld\n",++cnt,ans);
}
}