Matrix[矩陣乘法]
阿新 • • 發佈:2018-11-19
#include<bits/stdc++.h> #define N 15 #define LL long long using namespace std; struct Matrix{ LL a[N][N]; Matrix(){memset(a,0,sizeof(a));} }; int n,m; LL Mod=10000007; Matrix mul(Matrix A,Matrix B){ Matrix C; for(int i=1;i<=n+2;i++) for(int j=1;j<=n+2;j++) for(int k=1;k<=n+2;k++) C.a[i][j] = (C.a[i][j] + A.a[i][k]*B.a[k][j]) % Mod; return C; } Matrix power(Matrix X,int M){ Matrix ans; for(int i=1;i<=n+2;i++) ans.a[i][i]=1; for(;M;M>>=1){ if(M&1) ans = mul(X,ans); X = mul(X,X); } return ans; } int main(){ while(~scanf("%d%d",&n,&m)){ Matrix A,B; for(int i=1;i<=n;i++){ scanf("%d",&A.a[i+1][1]); }A.a[1][1]=23 , A.a[n+2][1]=3; for(int i=1;i<=n+1;i++) B.a[i][1]=10; for(int i=1;i<=n+2;i++) B.a[i][n+2]=1; for(int i=1;i<=n+1;i++) for(int j=2;j<=i;j++) B.a[i][j]=1; B = power(B,m); A = mul(B,A); printf("%lld\n",A.a[n+1][1] % Mod); }return 0; }