矩阵快速幂 HDU5015

#include <iostream>
#include <cstring>

using namespace std;

long long tmp[11];

//矩阵大小上限
const int SIZ=100;
int MOD=10000007;

//矩阵大小为n*m，初始化全部为0
struct mat
{
    int n,m;
    long long ar[SIZ][SIZ];
    mat()
    {
        memset(ar,0,sizeof(ar));
        n=m=SIZ;
    };
};

//矩阵乘法
mat operator *(mat a,mat b)
{
    mat c;
    c=mat();
    c.n=a.n;
    c.m=b.m;
    for(int i=1;i<=a.n;i++)
        for(int j=1;j<=b.m;j++)
            for(int k=1;k<=a.m;k++)
            {
                c.ar[i][j]+=(a.ar[i][k]*b.ar[k][j])%MOD;
                c.ar[i][j]%=MOD;
            }
    return c;
}

//矩阵加法
mat operator +(mat a,mat b)
{
    mat c;
    c=mat();
    c.n=a.n;
    c.m=a.m;
    for(int i=1;i<=a.n;i++)
        for(int j=1;j<a.m;j++)
            c.ar[i][j]=a.ar[i][j]+b.ar[i][j];
    return c;
}

//矩阵快速幂
mat operator ^(mat a,int k)
{
    mat c;
    c=mat();
    c.n=a.n;
    c.m=a.m;
    for(int i=1;i<=a.n;i++)
        c.ar[i][i]=1;
    while(k)
    {
        if(k&1)
            c=c*a;
        a=a*a;
        k/=2;
    }
    return c;
}

int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        for(int i=1;i<=n;i++)
        {
            cin>>tmp[i];
        }
        mat mat1;
        mat1=mat();
        mat1.m=mat1.n=n+2;
        for(int i=1;i<mat1.m;i++)
        {
            for(int t=2;t<=i;t++)
            {
                mat1.ar[i][t]=1;
            }
            mat1.ar[i][1]=10;
            mat1.ar[i][mat1.m]=1;
        }
        mat1.ar[mat1.m][mat1.m]=1;
        mat mat2 ;
        mat2 =mat();
        mat2.n=n+2;
        mat2.m=1;
        for(int i=2;i<mat2.n;i++)
        {
            mat2.ar[i][1]=tmp[i-1];
        }
        mat2.ar[1][1]=23;
        mat2.ar[mat2.n][1]=3;
        mat mat3;
        mat3=(mat1^(m))*mat2;
        cout<<mat3.ar[n+1][1]<<endl;
    }
    return 0;
}