求组合数 Lightoj1067

                                                           Combinations

 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

题意求

费马小定理求逆元除法取模，打表算阶乘。（不打表会TLE）

#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
const int MOD=1000003;
const int maxn=1e6+5;
int t;
long long n,k;
long long a[maxn];
long long b[maxn];
ll quickpow(ll a,ll b)
{
    ll ans=1;
    while(b)
    {
        if(b&1) ans=(ans*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return ans;
}

int main()
{
    cin>>t;
    int cas=1;
    a[0]=1;
    b[0]=1;
    for(int i=1;i<=maxn-5;++i)
    {
        a[i]=(a[i-1]*i)%MOD;
        b[i]=quickpow(a[i],MOD-2);
    }
    while(t--)
    {
        scanf("%d%d",&n,&k);
        long long ans=(a[n]*b[k])%MOD;
        ans=(ans*b[n-k])%MOD;
        //cout<<a[n-k]<<' '<<a[k]<<endl;
        printf("Case %d: ",cas++);
        printf("%lld\n",ans);
    }
}