E - Matrix Power Series

E - Matrix Power Series

Time Limit:3000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 3233

Description

Given a n × n matrix A and a positive integer k, find the sum S = A + A² + A³ + … + A^k.

Input

The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 10⁹) and m (m < 10⁴). 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.

Sample Input

2 2 4
0 1
1 1

Sample Output

1 2
2 3

模板题。。。。

下面附上代码：

# include<cstdio>
# include<cstring>
using namespace std;
#define NUM 50
int k,n,m;
struct Matrix
{
	int a[NUM][NUM];
	void init()           
	{
		memset(a,0,sizeof(a));
		for(int i=0;i<n;i++)
			a[i][i]=1;
	}
} A;
Matrix mul(Matrix a,Matrix b)  
{
	Matrix ans;
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
		{
			ans.a[i][j]=0;
			for(int k=0;k<n;k++)
				ans.a[i][j]+=a.a[i][k]*b.a[k][j];
			ans.a[i][j]%=m;
		}
	return ans;
}

Matrix add(Matrix a,Matrix b)  
{
	int i,j,k;
	Matrix ans;
	for(i=0;i<n;i++)
		for(j=0;j<n;j++)
		{
			ans.a[i][j]=a.a[i][j]+b.a[i][j];
			ans.a[i][j]%=m;
		}
	return ans;
}

Matrix pow(Matrix a,int n) 
{
	Matrix ans;
	ans.init();
	while(n)
	{
		if(n%2)
			ans=mul(ans,a);
		n/=2;
		a=mul(a,a);
	}
	return ans;
}

Matrix sum(Matrix a,int n)  
{
	int m;
	Matrix ans,pre;
	if(n==1)
		return a;
	m=n/2;
	pre=sum(a,m);                     
	ans=add(pre,mul(pre,pow(a,m)));   
	if(n&1)
		ans=add(ans,pow(a,n));          
	return ans;
}
int main()
{
	Matrix ans;
	scanf("%d%d%d",&n,&k,&m);
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
		{
			scanf("%d",&A.a[i][j]);
			A.a[i][j]%=m;
		}
	ans=sum(A,k);
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			printf("%d%c",ans.a[i][j],j==n-1?'\n':' ');
	return 0;
}