Hdoj 5015 233 Matrix

Construction matrix + quick power

233 Matrix Time Limit: 10000/5000 MS (Java/others) memory limit: 65536/65536 K (Java/Others)
Total submission (s): 344 accepted submission (s): 231


Problem descriptionin our daily life we often use 233 to express our feelings. actually, we may say 2333,233 33, or 233333... in the same meaning. and here is the question: Suppose we have a matrix called 233 matrix. in the first line, it wocould be 233,233 3, 23333... (It means A0, 1 = 233, A0, 2 = 2333, A0, 3 = 23333 ...) besides, in 233 matrix, we got AI, j = ai-1, J + AI, J-1 (I, j = 0 ). now you have known A1, 0, A2, 0,..., An, 0, cocould you tell me an, m in the 233 matrix?
Inputthere are multiple test cases. Please process till EOF.

For each case, the first line contains two postive integers n, m (n ≤ 10, M ≤109 ). the second line contains N integers, A1, 0, A2, 0 ,..., an, 0 (0 ≤ AI, 0 <231 ).
Outputfor each case, output an, M mod 10000007.
Sample Input

1 112 20 03 723 47 16

 
Sample output

234279972937Hint
  

 
Source2014 ACM/ICPC Asia Regional Xi 'an online

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long int LL;const LL MOD=10000007LL;int n,m;LL a[20];struct Matrix{int x,y;LL matrix[12][12];Matrix(){x=y=0;memset(matrix,0,sizeof(matrix));}};void init(Matrix& m){m.x=m.y=n+2;for(int i=0;i<m.x-2;i++)for(int j=i;j<m.y-1;j++)m.matrix[i][j]=1;m.matrix[m.x-2][m.y-2]=10;m.matrix[m.x-1][m.y-1]=m.matrix[m.x-2][m.y-1]=1;}Matrix CHENGFA(Matrix& a,Matrix& b){int n=a.x;Matrix ret;ret.x=ret.y=n;for(int i=0;i<n;i++){for(int j=0;j<n;j++){LL temp=0;for(int k=0;k<n;k++){temp=(temp+(a.matrix[i][k]*b.matrix[k][j])%MOD)%MOD;}ret.matrix[i][j]=temp%MOD;}}return ret;}Matrix MatrixQuickPow(Matrix m,int k){Matrix e;int n=m.x;e.x=e.y=n;for(int i=0;i<n;i++) e.matrix[i][i]=1;while(k){if(k%2)e=CHENGFA(e,m);m=CHENGFA(m,m);k/=2;}return e;}int main(){while(scanf("%d%d",&n,&m)!=EOF){for(int i=n-1;i>=0;i--)scanf("%lld",a+i);a[n]=233; a[n+1]=3;Matrix M,ED;init(M);ED=MatrixQuickPow(M,m-1);LL ans=0;for(int i=0;i<n+1;i++){LL temp=0;for(int j=0;j<n+2;j++){temp=(temp+(ED.matrix[i][j]*a[j])%MOD)%MOD;}ans=(ans+temp)%MOD;}printf("%I64d\n",ans);}return 0;}

Hdoj 5015 233 Matrix