先上一份代码
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
#define mod 9973
#define ll long long
int n;
ll k;
struct Matrix{
int v[11][11],x,y;
inline void empty(){
memset(v,0,sizeof(v)),x=0,y=0;
}
}m,e,ans,aa,bb;
inline void add(int &x,int y){
x=(x+y)%mod;
}
Matrix mul(Matrix a,Matrix b){
aa.empty();
for(int i=0;i<=a.x;++i){
for(int j=0;j<=b.y;++j){
for(int p=0;p<=b.x;++p){
add(aa.v[i][j],a.v[i][p]*b.v[p][j]%mod);
}
}
}
aa.x=a.x,aa.y=b.y;
return aa;
}
Matrix ksm(Matrix x,ll y){
bb.empty();
bb.x=x.x,bb.y=x.y;
for(int i=0;i<=x.x;i++)bb.v[i][i]=1;
for(;y;x=mul(x,x),y>>=1)if(y&1)bb=mul(bb,x);
return bb;
}
int main(){
scanf("%d%lld",&n,&k);
for(int i=0;i<n;i++)scanf("%d",&e.v[n][i+1]);
scanf("%d",&e.v[n][0]);
e.x=e.y=n;//!
for(int i=1;i<n;i++)e.v[i][i+1]=1;//0 cant be 1
e.v[0][0]=1;//!
for(int i=1;i<=n;i++)scanf("%d",&m.v[i][0]);
m.v[0][0]=1;
m.x=n,m.y=0;//!
ans=mul(ksm(e,k-n+1),m);
printf("%d\n",ans.v[n][0]);
}
注意的点在代码中有体现。