HDU3037（Lucas定理）

Saving Beans

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3542 Accepted Submission(s): 1354

Problem Description
Although winter is far away, squirrels have to work day and night to save beans. They need plenty of food to get through those long cold days. After some time the squirrel family thinks that they have to solve a problem. They suppose that they will save beans in n different trees. However, since the food is not sufficient nowadays, they will get no more than m beans. They want to know that how many ways there are to save no more than m beans (they are the same) in n trees.

Now they turn to you for help, you should give them the answer. The result may be extremely huge; you should output the result modulo p, because squirrels can’t recognize large numbers.

Input
The first line contains one integer T, means the number of cases.

Then followed T lines, each line contains three integers n, m, p, means that squirrels will save no more than m same beans in n different trees, 1 <= n, m <= 1000000000, 1 < p < 100000 and p is guaranteed to be a prime.

Output
You should output the answer modulo p.

Sample Input
2
1 2 5
2 1 5

Sample Output
3
3
Hint

Hint

For sample 1, squirrels will put no more than 2 beans in one tree. Since trees are different, we can label them as 1, 2 … and so on.
The 3 ways are: put no beans, put 1 bean in tree 1 and put 2 beans in tree 1. For sample 2, the 3 ways are:
put no beans, put 1 bean in tree 1 and put 1 bean in tree 2.

Source
2009 Multi-University Training Contest 13 - Host by HIT

Recommend
gaojie | We have carefully selected several similar problems for you: 3033 3038 3036 3035 3034

公式是C（n+m，m）用Lucas定理就过了

#include "cstring"#include "iostream"#include "string.h"#include "cstdio"using namespace std;typedef long long LL;const int INF = 0x3f3f3f3f;const int maxn = 100005;LL fact[maxn];LL p;LL quick_pow(LL a, LL k){    LL ans = 1;    while(k)    {        if(k & 1) (ans *= a) %= p;        (a *=a) %= p;        k >>= 1;    }    return ans;}void Init(){    fact[0] = 1;    for(int i = 1; i <= p; i ++)    {        fact[i] = fact[i - 1] * i % p;    }}LL Inv(LL n){    return quick_pow(n, p - 2);}LL C(LL n, LL m){    if(n < m) return 0;    return fact[n] * Inv(fact[n - m] * fact[m] % p) % p;}LL lucas(LL n, LL m){    if(m == 0) return 1;    return C(n % p, m % p) * lucas(n / p, m / p) % p;}int main(){    int T;    LL n, m;    scanf("%d", &T);    while(T--)    {        scanf("%lld%lld%lld", &n, &m, &p);        Init();        printf("%lld\n", lucas(n+m, m));    }    return 0;}