uva10870 Recurrences 矩阵快速幂

题目链接

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=20;
typedef long long ll;
int n,m,d;
int a[MAXN],f[MAXN];
struct Matrix
{
    ll matrix[MAXN][MAXN];
}E;
Matrix matrix_mul(Matrix a,Matrix b)
{
    Matrix c;
    for(int i=1;i<=d;i++)
        for(int j=1;j<=d;j++)
        {
            c.matrix[i][j]=0;
            for(int k=1;k<=d;k++)
                if(a.matrix[i][k] && b.matrix[k][j])
                {
                    c.matrix[i][j]+=a.matrix[i][k]*b.matrix[k][j];
                    if(c.matrix[i][j]>=m)
                        c.matrix[i][j]%=m;
                }
        }
    return c;
}
Matrix matrix_pow(Matrix a,int k)
{
    Matrix c=E;
    while(k)
    {
       if(k&1)
            c=matrix_mul(a,c);
       a=matrix_mul(a,a);
       k>>=1;
    }
    return c;
}
int main()
{
    //freopen("text.txt","r",stdin);
    for(int i=0;i<MAXN;i++)
        E.matrix[i][i]=1;
    while(~scanf("%d%d%d",&d,&n,&m) && d+n+m)
    {
        for(int i=1;i<=d;i++)
            scanf("%d",&a[i]);
        for(int i=1;i<=d;i++)
            scanf("%d",&f[i]);
        Matrix A;
        memset(A.matrix,0,sizeof(A.matrix));
        for(int i=1;i<=d-1;i++)
            A.matrix[i][i+1]=1;
        for(int i=1;i<=d;i++)
            A.matrix[d][i]=a[d+1-i];
        A=matrix_pow(A,n-d);
        ll ans=0;
        for(int i=1;i<=d;i++)
        {
            ans+=A.matrix[d][i]*f[i];
            if(ans>=m)
                ans%=m;
        }
        printf("%lld\n",ans);
    }
    return 0;
}