矩阵快速幂+二分法poj3233经典例题
Matrix Power Series
Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.
Input
The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 109) and m (m < 104). Then follow n lines each containing n nonnegative integers below 32,768, giving A’s elements in row-major order.
Output
Output the elements of S modulo m in the same way as A is given
题目大意是求S(k)=A+A2+……+Ak;第一眼看着像等比数列求和公式,但难点就是A是矩阵,如果直接暴力求解的话肯定会超时,所以要优化一下,采用二分求解即可AC;
领S(N)=A+A2+……+AN;
则S(6)=A+A2+A3+A4+A5+A6=(1+A3)*S(3);
同理: S(7)=A+(A+A^4)*S(3);
公式就出来了,k为奇数和偶数的公式就有了,接下来按部就班完成就OK啦,下面附上代码;
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,k,m;
struct Martix
{
int z[50][50];
};
Martix Mul(Martix A,Martix B) //矩阵相乘
{
Martix x;
for(int i=0;i<n;i++)
{for(int j=0;j<n;j++)
{x.z[i][j]=0;
for(int k=0;k<n;k++)
x.z[i][j]=(x.z[i][j]+A.z[i][k]*B.z[k][j])%m;
}
}
return x;
}
Martix add(Martix A,Martix B) //矩阵相加
{
Martix l;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
l.z[i][j]=A.z[i][j]+B.z[i][j];
return l;
}
Martix pow(Martix A,int k)//求解A^k;
{
if(k==0)
{
memset(A.z,0,sizeof(A.z));
for(int i=0;i<n;i++)
A.z[i][i]=1;
return A;
}
else if(k==1)
return A;
else
{
Martix X=pow(A,k/2);
if(k%2)
return Mul(Mul(X,X),A);
else
return Mul(X,X);
}
}
Martix Sum(Martix x,int n) //求解S(k),利用二分法
{
if(n==1)
return x;
if(n&1)
{
Martix B=add(x,pow(x,n/2));
return add(x,Mul(B,Sum(x,n/2)));
}
else
{
Martix B=add(pow(x,0),pow(x,n/2));
return Mul(B,Sum(x,n/2));
}
}
int main()
{
cin>>n>>k>>m;
Martix A;
int l;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{ cin>>l;
A.z[i][j]=l%m;}
Martix s=Sum(A,k);
for(int i=0;i<n;i++)
{ for(int j=0;j<n-1;j++)
cout<<s.z[i][j];
cout<<s.z[i][n-1]<<endl;}
}