light oj 1067Combinations

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

题意：求组合数C(m,n)%1e6+3，m，n的范围为1e6

这题要用到费马小定理求逆元，详情可参考：http://www.cnblogs.com/16er/p/5159396.html，知道求逆元的方法就可以用快速幂算出来了，因为数据范围不算不太可以用卢卡斯定理求出，卢卡斯定理详情课参考：http://blog.csdn.net/pi9nc/article/details/9615359

Combinations 
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<vector>

using namespace std;

typedef long long ll;

#define sf scanf
#define pf printf
#define mem(i,a) memset(i,a,sizeof i)
#define for0(i,a) for(int (i)=0;(i)<(a);(i)++)
#define for1(i,a) for(int (i)=1;(i)<=(a);(i)++)

const int Max=1e6+3;
ll fac[Max+1],m,n,T;

ll quick(ll a,ll b)//快速幂
{
    ll ans=1;
    while(b)
    {
        if(b&1)
            ans=ans*a%Max;
        b>>=1;
        a=a*a%Max;
    }
    return ans;
}

void fact()//阶乘打表
{
    fac[0]=1;
    for(int i=1;i<=Max;i++)
    {
        fac[i]=fac[i-1]*i%Max;
    }
}

ll Lucas(ll m,ll n)//卢卡斯定理
{
    ll ans=1;
    while(m&&n)
    {
        ll a=m%Max,b=n%Max;
        if(a<b)
            return 0;
        ans=((ans*fac[a]%Max)*(quick(fac[b]*fac[a-b]%Max,Max-2)))%Max;
        m/=Max;
        n/=Max;
    }
    return ans;
}

int main()
{
    fact();
    sf("%I64d",&T);
    for1(i,T)
    {
        sf("%lld%lld",&m,&n);
        pf("Case %d: %lld\n",i,Lucas(m,n));
    }
    return 0;
}