Combinations（组合数学）

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

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 ≤ 10⁶), 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

题意 ： 输入n,k ，输出 C[n][k] (Cn k);

#include <iostream>
#include <cstdio>
#define LL long long
using namespace std;
const int maxn=1000005;
const int mod =1000003;

LL f[maxn],ni[maxn];
int n,k,T;

LL pow_mod(LL num,int t)    //  快速幂求逆元
{
    LL p=num,q=t,ret=1;
    while(q)
    {
        if(q & 1)  ret = ret*p%mod;
        q>>=1;
        p=p*p%mod;
    }
    return ret%mod;
}

void initial()
{
    f[0]=f[1]=1;
    ni[0]=ni[1]=1;
    for(int i=2;i<maxn;i++)
    {
          f[i]=f[i-1]*i%mod;
          ni[i]=pow_mod(f[i],mod-2);
    }
}

int main()
{
     initial();
     scanf("%d",&T);
     for(int co=1;co<=T;co++)
     {
           scanf("%d %d",&n,&k);
           printf("Case %d: %lld\n",co,f[n]*ni[k]%mod*ni[n-k]%mod);
     }
     return 0;
}