hdu3037 Saving Beans

题意:  给了n课不同的树，要求将 0,1,2,3,4,5,...m个松果，分别放在n棵树上的方案数有多少
    总结：当选取得数含有0时，要转化,然而开始并不会组合数学太烂了

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <map>
//#define IO  ios::sync_with_stdio(false),cin.tie(0), cout.tie(0);
//#pragma comment(linker, "/STACK:1024000000,1024000000")
void ex_gcd(int a, int b, int &d, int &x, int &y) { if (!b) { x = 1; y = 0; d = a; } else { ex_gcd(b, a%b, d, y, x); y -= x * (a / b); }; }
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int lcm(int a,int b){return a/gcd(a,b)*b;}
int inv_exgcd(int a, int m) { int d, x, y;ex_gcd(a, m, d, x, y);return d == 1 ? (x + m) % m : -1; }
typedef long long ll;
const int maxn=1e6;
using namespace std;
ll fac[maxn];
ll a,b,mod;
void init()
{
    fac[0]=1;
    for(int i=1;i<=mod;++i)
        fac[i]=fac[i-1]*i%mod;
}
ll C(ll n,ll m,ll mod)
{
    if(m>n)return 0;
    ll ans=fac[n];
    ans*=inv_exgcd((fac[m]*fac[n-m])%mod,mod);
    return ans%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()
{
    ll t;
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld%lld%lld",&a,&b,&mod);
           init();
            ll lu=Lucas(1+b,a,mod);
        printf("%lld\n",lu);
    }
    return 0;
}

//waw:
///https://blog.csdn.net/sdfzchy/article/details/76099080
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <map>
//#define IO  ios::sync_with_stdio(false),cin.tie(0), cout.tie(0);
//#pragma comment(linker, "/STACK:1024000000,1024000000")
void ex_gcd(int a, int b, int &d, int &x, int &y) { if (!b) { x = 1; y = 0; d = a; } else { ex_gcd(b, a%b, d, y, x); y -= x * (a / b); }; }
int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }
int lcm(int a,int b){return a/gcd(a,b)*b;}//Ïȳýºó³Ë·ÀÒç³ö
int inv_exgcd(int a, int m) { int d, x, y;ex_gcd(a, m, d, x, y);return d == 1 ? (x + m) % m : -1; }
typedef long long ll;
const int maxn=1e4+10;
using namespace std;
int primer[maxn];
ll fac[maxn][maxn];
ll inv[maxn][maxn];
ll a[maxn];
ll n,m,mod,cnt=0;
void isprime()
{
    for(int i=2;i<maxn;++i)
    {
        if(!a[i])
        { primer[cnt++]=i;
            for(int j=2*i;j<=maxn;j+=i)
                a[j]=1;
        }
    }
}
void init()//预处理阶乘和逆元
{
    for(int i=0;i<cnt;++i)
    {
        fac[primer[i]][0]=inv[primer[i]][0]=1;
        for(int j=1;j<primer[i];++j)
        {
            fac[primer[i]][j] = (fac[primer[i]][j-1] * j) % primer[i];
            inv[primer[i]][j] = inv_exgcd(fac[primer[i]][j],primer[i]);
        }
    }
}
ll C(ll n,ll m,ll mod)
{
    if(m>n)return 0;
    if(n==m)return 1;
    return fac[mod][n]*(inv[mod][m]*inv[mod][n-m]%mod)%mod;
    //ll ans=fac[n]*inv_exgcd((fac[m]*fac[n-m])%mod,mod);    return ans%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()
{
    isprime();
    init();
       ll t;
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld%lld%lld",&n,&m,&mod);
            ll lu=Lucas(1+m,n,mod);
        printf("%lld\n",lu);
    }
    return 0;
}