Hdu5015 (233 Matrix)

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <string.h>
 4 #include <stdlib.h>
 5 #define maxn 15
 6 #define MOD 10000007
 7 using namespace std;
 8 class Matrix{
 9 public:
10     int row,col;
11     __int64 mapp[maxn][maxn];
12     Matrix(int r,int c):row(r),col(c){}
13     Matrix(){}
14     void ini()
15     {
16         memset(mapp,0,sizeof(mapp));
17         for(int i=2;i<row;i++)
18         {
19          mapp[0][i]=1;
20          for(int j=i;j<row;j++)
21           mapp[i][j]=1;
22         }
23         mapp[0][0]=10,mapp[1][0]=1,mapp[1][1]=1;
24     }
25     void unit() //单位矩阵的初始化
26     {
27         memset(mapp,0,sizeof(mapp));
28         for(int i=0;i<row;i++)
29          mapp[i][i]=1;
30     }
31     int result(int which) const{return mapp[0][which];}
32     friend Matrix operator*(const Matrix&,const Matrix&);
33     void Pow(int);
34 };
35 Matrix operator*(const Matrix& M1,const Matrix& M2)
36 {
37     Matrix M(M1.row,M2.col);
38     for(int i=0;i<M1.row;i++)
39      for(int j=0;j<M2.col;j++)
40      {
41         M.mapp[i][j]=0;
42         for(int k=0;k<M2.col;k++)
43          M.mapp[i][j]=(M.mapp[i][j]+M1.mapp[i][k]*M2.mapp[k][j])%MOD;
44      }
45     return M;
46 }
47 Matrix M;
48 int N;
49 void Matrix::Pow(int n)//矩阵快速幂
50 {
51     //cout<<n<<endl;
52     Matrix temp(N+2,N+2);
53     temp.ini();
54     while(n)
55     {
56         if(n&1)
57          M=M*temp;
58         temp=temp*temp;
59         n>>=1;
60     }
61 }
62 int main()
63 {
64     int m;
65     while(~scanf("%d%d",&N,&m))
66     {
67                  Matrix resM(1,N+2);
68                  M.row=M.col=N+2;
69                  M.unit();
70                  resM.mapp[0][0]=233,resM.mapp[0][1]=3;
71                  for(int i=1;i<=N;i++) scanf("%I64d",&resM.mapp[0][i+1]);
72                  M.Pow(m);
73                  resM=resM*M;
74                  cout<<resM.result(N+1)<<endl;
75     }
76     return 0;
77 }