矩阵快速幂模板

刚学了矩阵快速幂,花了点时间把之前的代码修改一下写成了矩阵类,就当做模板了......

话不多说下面贴代码

首先是头文件和宏定义什么的

#include <iostream>
#include <cstdio>
#include <string.h>

using namespace std;

#define INF	1000000000
#define maxm	20		
#define maxn	20

然后是矩阵类

class Matrix
{
public:
	friend Matrix operator * (Matrix a, Matrix b)
	{
		Matrix ret(a.m, b.n, a.mod);

		for(int k = 0; k < a.n; k++)
		{
			for(int i = 0; i < a.m; i++)
			{
				if(a.mat[i][k] == 0)
					continue;

				for(int j = 0; j < b.n; j++)
				{
					ret.mat[i][j] = (ret.mat[i][j] + a.mat[i][k] * b.mat[k][j]) % ret.mod;
				}
			}
		}

		return ret;
	}
	friend Matrix operator + (Matrix a, Matrix b)
	{
		Matrix ret(a.m, a.n, a.mod);

		for(int i = 0; i < ret.m; i++)
		{
			for(int j = 0; j < ret.n; j++)
			{
				ret.mat[i][j] = (a.mat[i][j] + b.mat[i][j]) % ret.mod;
			}
		}

		return ret;
	}
	Matrix(int row, int col, int mod);
	void Init();                            //读入矩阵
	void Clear();                           //清零
	void E();                           //变成一个单位矩阵
	void Print();                           //输出矩阵
	Matrix Quick_multipe(int k);        //矩阵二分快速幂
public:

	int m, n, mod;

	int mat[maxn][maxn];
};
Matrix:: Matrix(int row = maxm, int col = maxn, int Mod = INF)
{
	Clear();
	m = row;
	n = col;
	mod = Mod;
}
void Matrix::Init()
{
	for(int i = 0; i < m; i++)
	{
		for(int j = 0; j < n; j++)
		{
			scanf("%d", &mat[i][j]);
		}
	}
}
void Matrix::Clear()
{
	memset(mat, 0, sizeof(mat));
}
void Matrix::E()
{
	Clear();

	for(int i = 0; i < n && i < m; i++)
	{
		mat[i][i] = 1;
	}
}
void Matrix::Print()
{
	for(int i = 0; i < m; i++)
	{
		for(int j = 0; j < n; j++)
		{
			if(j != 0)printf(" ");

			printf("%d", mat[i][j]);
		}

		printf("\n");
	}
}
Matrix Matrix::Quick_multipe(int k)
{
	Matrix ANS(m, n, mod), P(m, n, mod);
	ANS.E();
	P = (*this);

	for(; k; k >>= 1)
	{
		if(k & 1) ANS = ANS * P;

		P = P * P;
	}

	return ANS;
}