Saving Beans HDU3037 ( 可重复的组合数计数原理+Lucas定理 )

本文链接：https://blog.csdn.net/u013167299/article/details/45064763

Saving Beans
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2648 Accepted Submission(s): 983

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

Statistic | Submit | Discuss | Note

Home | Top Hangzhou Dianzi University Online Judge 3.0

刘汝佳的白书的104页讲的可重复计数问题，就是这道题的应用

考虑加多一颗树，这样的话当加的树放了k(0<=k<=m)个beans时，原本的n颗树上放的beans数量之和就等于m-k（<=m）,满足题目的要求，也降低了计算的难度。则题目要求的是 a1+a2+......an+an+1=m（0<=ai<=m,1<=i<=n+1) 式1

解有多少组。考虑把问题转换成，求a1+a2+......an+an+1=m+n+1（1<=ai<=m+1,1<=i<=n+1) 式2

解有多少组。因为式1的每组解，对于每个ai，都加上1的话，就是式2的一组解。对于式2的求解考虑有m+n+1个Beans排成一列，则它们中恰好有m+n个间隔，在m+n个间隔中选择n个各插入一块木板，则把这些Beans分成n+1部分，每部分的值对应到每个ai，就是式2的一组解。而在m+n个间隔中选择n个，则是求组合数的问题了，p<=10^5且为质数，则可用Lucas定理求。
以下另外一种分析转载于：http://blog.csdn.net/tju_virus/article/details/7843248
题目相当于求n个数的和不超过m的方案数。如果和恰好等于m，那么就等价于方程x1+x2+...+xn = m的解的个数，利用插板法可以得到方案数为：(m+1)*(m+2)...(m+n-1) = C(m+n-1,n-1) = C(m+n-1,m)现在就需要求不大于m的，相当于对i = 0,1...,m对C(n+i-1,i)求和，根据公式C(n,k) = C(n-1,k)+C(n-1,k-1)得C(n-1,0)+C(n,1)+...+C(n+m-1,m)= C(n,0)+C(n,1)+C(n+1,2)+...+C(n+m-1,m)= C(n+m,m)现在就是要求C(n+m,m) % p,其中p是素数。然后利用Lucas定理的模板就可以轻松的求得C(n+m,m) % p的值

简单介绍一下Lucas定理：Lucas定理是用来求 C(n,m) mod p的值,p是素数（从n取m组合，模上p）。
描述为:
Lucas(n,m,p)=C(n%p,m%p)* Lucas(n/p,m/p,p)
Lucas(x,0,p)=1;
A、B是非负整数，p是质数。AB写成p进制：A=a[n]a[n-1]...a[0]，B=b[n]b[n-1]...b[0]。则组合数C(A,B)与C(a[n],b[n])*C(a[n-1],b[n-1])*...*C(a[0],b[0]) modp同余即：Lucas(n,m,p)=c(n%p,m%p)*Lucas(n/p,m/p,p) </p>简单的理解就是：以求解n! % p 为例，把n分段，每p个一段，每一段求得结果是一样的。但是需要单独处理每一段的末尾p,2p,...,把p提取出来，会发现剩下的数正好又是(n/p)! ，相当于划归了一个子问题，这样递归求解即可。这个是单独处理n！的情况，当然C(n,m)就是n！/(m! *（ｎ－ｍ）！），每一个阶乘都用上面的方法处理的话，就是Lucas定理了Lucas最大的数据处理能力是p在10^5左右。</p><p>而C(a,b) =a! / ( b! * (a-b)! ) mod p其实就是求 ( a! / (a-b)!) * ( b! )^(p-2) mod p (上面这一步变换是根据费马小定理：假如p是质数，且a,p互质，那么a的（p-1）次方除以p的余数恒为1,那么a和a^(p-2)互为乘法逆元，则（b / a) = (b * a^(p-2) ) mod p)


#include<cstdio>
#include<algorithm>
#include<cmath>
#include<bits/stdc++.h>
using namespace std;
template<class T>inline T read(T&x)
{
    char c;
    while((c=getchar())<=32)if(c==EOF)return 0;
    bool ok=false;
    if(c=='-')ok=true,c=getchar();
    for(x=0; c>32; c=getchar())
        x=x*10+c-'0';
    if(ok)x=-x;
    return 1;
}
template<class T> inline T read_(T&x,T&y)
{
    return read(x)&&read(y);
}
template<class T> inline T read__(T&x,T&y,T&z)
{
    return read(x)&&read(y)&&read(z);
}
template<class T> inline void write(T x)
{
    if(x<0)putchar('-'),x=-x;
    if(x<10)putchar(x+'0');
    else write(x/10),putchar(x%10+'0');
}
template<class T>inline void writeln(T x)
{
    write(x);
    putchar('\n');
}
//-------ZCC IO template------
const int maxn=11;
const double inf=999999999;
#define lson (rt<<1),L,M
#define rson (rt<<1|1),M+1,R
#define M ((L+R)>>1)
#define For(i,t,n) for(int i=(t);i<(n);i++)
typedef long long  LL;
typedef double DB;
typedef pair<int,int> P;
#define bug printf("---\n");
//#define mod 10007

LL powmod(LL a,LL b,LL mod)
{
    LL rec=1;
    while(b)
    {
        if(b&1)rec=(rec*a)%mod;
        a=(a*a)%mod;
        b>>=1;
    }
    return rec%mod;
}

LL C(LL a,LL b,LL mod)
{
    LL ans=1,ca=1,cb=1;
    if(a<b)return 0;
    if(a==b)return 1;
    if(b>a-b)b=a-b;
    for(int i=0;i<b;i++)
    {
        ca=(ca*(a-i))%mod;
        cb=(cb*(b-i))%mod;
    }
    return ca*powmod(cb,mod-2,mod)%mod;
}

LL Lucas(LL n,LL m,LL mod)
{
    if(m==0)return 1;
    return C(n%mod,m%mod,mod)*Lucas(n/mod,m/mod,mod)%mod;
}



int main()
{
    //#ifndef ONLINE_JUDGE
    //freopen("in.txt","r",stdin);
    //freopen("zccccc.txt","w",stdout);
    //#endif // ONLINE_JUDGE
    int mod;
    int n,m,i,j,t,k;
    int T;
    read(T);
    while(T--)
    {
        read__(n,m,mod);
        writeln(Lucas(n+m,m,mod));
    }
    return 0;
}