233 Matrix
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2178 Accepted Submission(s): 1273
Problem Description
In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meaning. And here is the question: Suppose we have a matrix called 233 matrix. In the first line, it would be 233, 2333, 23333... (it means a
0,1 = 233,a
0,2 = 2333,a
0,3 = 23333...) Besides, in 233 matrix, we got a
i,j = a
i-1,j +a
i,j-1( i,j ≠ 0). Now you have known a
1,0,a
2,0,...,a
n,0, could you tell me a
n,m in the 233 matrix?
Input
There are multiple test cases. Please process till EOF.
For each case, the first line contains two postive integers n,m(n ≤ 10,m ≤ 10 9). The second line contains n integers, a 1,0,a 2,0,...,a n,0(0 ≤ a i,0 < 2 31).
For each case, the first line contains two postive integers n,m(n ≤ 10,m ≤ 10 9). The second line contains n integers, a 1,0,a 2,0,...,a n,0(0 ≤ a i,0 < 2 31).
Output
For each case, output a
n,m mod 10000007.
Sample Input
1 1 1 2 2 0 0 3 7 23 47 16
Sample Output
234 2799 72937Hint
Source
转载:
很显然矩阵的第一列为:
0
a[1]
a[2]
a[3]
a[4]
我们转化一下,转化为
23
a[1]
a[2]
a[3]
a[4]
3
那么由第一列转移到第二列则为
23*10+3
a[1]+23*10+3
a[2]+a[1]+23*10+3
a[3]+a[2]+a[1]+23*10+3
a[4]+a[3]+a[2]+a[1]+23*10+3
3
很显然转移矩阵A就出来了:
10 0 0 0 0 1
10 1 0 0 0 1
10 1 1 0 0 1
10 1 1 1 0 1
10 1 1 1 1 1
0 0 0 0 0 1
那么最后一列就是A的m次方*第一列。
我不会构造这题矩阵,要多练多想啊!!
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#include<map>
using namespace std;
typedef pair<int,int > P;
typedef long long LL;
const int maxn=100;
#define N 15
#define mod 10000007
int n,m;
struct Matrix
{
LL mat[N][N];
Matrix()
{
memset(mat,0,sizeof(mat));
}
};
Matrix mul(Matrix a,Matrix b)
{
Matrix res;
for(int i=0; i<N; i++)
for(int j=0; j<N; j++)
{
for(int k=0; k<N; k++)
{
res.mat[i][j]+=a.mat[i][k]*b.mat[k][j];
res.mat[i][j]%=mod;
}
}
return res;
}
Matrix pow_matrix(Matrix a,int n) //矩阵快速幂;
{
Matrix res;
for(int i=0; i<N; i++) //初始化为单位矩阵;
res.mat[i][i]=1;
while(n!=0)
{
if(n&1)
res=mul(res,a);
a=mul(a,a);
n>>=1;
}
return res;
}
void print()
{
cout<<"The matrix -->"<<endl;
//....
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
Matrix A,B;
for(int i=1; i<=n; i++) //构造矩阵!!
scanf("%d",&A.mat[i][0]);
A.mat[0][0]=23;
A.mat[n+1][0]=3;
for(int i=0; i<n+1; i++) B.mat[i][0]=10;
for(int i=0; i<=n+1; i++) B.mat[i][n+1]=1;
for(int i=1; i<n+1; i++)
for(int j=1; j<=i; j++) B.mat[i][j]=1;
B=pow_matrix(B,m);
A=mul(B,A);
printf("%lld\n",A.mat[n][0]);
}
return 0;
}
手残,mod打错了,耽误了一小时
;
手残,mod少打了一个零,耽误一小时;