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
因为数据非常的大所以用一般的暴力会超时,所以这里要用到Lusca来计算排列组合,具体代码如下:
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <string.h>
#include <iostream>
using namespace std;
const long long MOD = 1000003;
long long fac[1000005];
long long pow(long long a, long long b, long long c)
{
long long tmp = 1;
while (b)
{
if (b & 1) tmp = (tmp*a) % c;
a = (a*a) % c;
b >>= 1;
}
return tmp;
}
void get_fac(long long p)
{
fac[0] = 1;
for (int i = 1;i <= p;i++)
fac[i] = (fac[i - 1] * i) % p;
}
long long Lucas(long long n, long long m, long long p)
{
long long tmp = 1;
while (n && m)
{
long long a = n%p, b = m%p;
if (a < b) return 0;
tmp = (tmp * fac[a] * pow(fac[b] * fac[a - b] % p, p - 2, p)) % p;
n /= p;
m /= p;
}
return tmp;
}
int main()
{
int n, m;
get_fac(MOD);
int T;
scanf("%d", &T);
for (int t = 1;t <= T;t++)
{
scanf("%d %d", &n, &m);
int ans = Lucas(n, m, MOD);
printf("Case %d: %d\n", t, ans);
}
return 0;
}
基本上就是Lusca的模板