[JZOJ5215]【HEOI、SXOI2017】组合数问题

Description

求

$$\Large \sum\limits_{i=0}^{ik+r\leq nk}{C_{nk}^{ik+r}}\mod p$$
其中 $1\leq n \leq 10^9,0\leq r<k\leq 50,2\leq p\leq 2^{30}-1$

Solution

考虑组合数的实际意义
有nk个物品，取的物品数模k等于r的方案数

设$\large F_{i,j}$表示前i个物品，选的个数模k等于j的方案数

显然

$$\Large F_{i,j}=F_{i-1,j}+F_{i-1,j-1}$$
特别的，当 $j=0$
$$\Large F_{i,0}=F_{i-1,0}+F_{i-1,k-1}$$

显然可以直接矩乘优化

Code

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define LL long long 
#define N 1000005
using namespace std;
LL n,p,k,r;
struct node
{
    LL a[51][51];
    friend node operator *(node x,node y)
    {
        node c;
        memset(c.a,0,sizeof(c.a));
        fo(i,0,k-1)
        {
            fo(j,0,k-1)
            {
                fo(q,0,k-1)
                {
                    (c.a[i][j]+=x.a[i][q]*y.a[q][j]%p)%=p;
                }
            }
        }
        return c;
    }
}s,t;
node ksm(node k,LL n)
{
    if(n==1) return k;
    node s=ksm(k,n/2);
    return (n%2)?s*s*k:s*s;
}
int main()
{
    cin>>n>>p>>k>>r;
    fo(i,1,k-1) t.a[i][i]++,t.a[i-1][i]++;
    t.a[0][0]++,t.a[k-1][0]++;
    s.a[0][0]=1;
    t=ksm(t,n*k);
    s=s*t;
    printf("%lld\n",s.a[0][r]);
}