LightOJ - 1067 Combinations（逆元求组合数）

最新推荐文章于 2019-08-07 11:05:34 发布

aero1009

最新推荐文章于 2019-08-07 11:05:34 发布

阅读量219

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/aero1009/article/details/81436305

版权

数论专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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<iostream>
#include<cstring>
#include<algorithm>
typedef long long ll;
using namespace std;
const int maxn=1e6+5;
const int MOD=1000003;
ll f[maxn];
void init()
{
	f[0]=1;
	for(ll i=1;i<maxn;i++)
		f[i]=(f[i-1]*i)%MOD;
}
ll exgcd(ll a,ll b,ll &x,ll &y)
{
	if(b==0)
	{
		x=1;
		y=0;
		return a;
	}
	else
	{
		ll d=exgcd(b,a%b,y,x);
		y-=a/b*x;
		return d; 
	}
}
ll pow_mod(ll a, ll n, ll p){
    ll ret = 1;
    ll tmp = a;
    while(n) {
        if(n & 1) ret = (ret * tmp) % p;
        tmp = tmp * tmp % p;
        n >>= 1;
    }
    return ret;
}
ll inv(ll a,ll p)
{
	return pow_mod(a,p-2,p);
}
ll C(ll n,ll k,ll p)
{
	if(n==k||k==0)return 1;
	else 
	{
		ll ans1=f[k]*f[n-k]%p;
		ll ans2=inv(ans1,p);
		return (f[n]*ans2)%p;
	}
}
int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	init();
	int T,cas=0;
	cin>>T;
	while(T--)
	{
		ll n,k;
		cas++;
		cin>>n>>k;
		cout<<"Case "<<cas<<": "<<C(n,k,MOD)<<endl;
	}
	return 0;
}