矩阵快速幂

因为刚学，所以本蒟蒻用了一晚上肝出来了……（doge

下面展示的是不含主函数的部分代码（含加、减、乘、快速幂）：

const int N = 110;
struct mat //矩阵结构体
{
	int n, m, a[N][N]; //行数，列数，以及保存整个矩阵的二维数组
	void input()
	{
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
	}
	void print()
	{
		for (int i = 1; i <= n; i++, printf("\n"))
			for (int j = 1; j <= m; j++) printf("%d ", a[i][j]);
	}
}I;
mat operator + (mat x, mat y)
{
	mat z;
	z.n = x.n, z.m = x.m;
	for (int i = 1; i <= z.n; i++)
		for (int j = 1; j <= z.m; j++) z.a[i][j] += x.a[i][j] + y.a[i][j];
	return z;
}
mat operator - (mat x, mat y)
{
	mat z;
	z.n = x.n, z.m = x.m;
	for (int i = 1; i <= z.n; i++)
		for (int j = 1; j <= z.m; j++) z.a[i][j] += x.a[i][j] - y.a[i][j];
	return z;
}
mat operator * (mat x, mat y)
{
	mat z;
	z.n = x.n, z.m = y.m;
	for (int i = 1; i <= z.n; i++)
		for (int j = 1; j <= z.m; j++)
			for (int k = 1; k <= x.m; k++) z.a[i][j] += x.a[i][k] * y.a[k][j];
	return z;
}
mat calc(mat x, int y) //快速幂
{
	mat ret = I;
	while (y)
	{
		if (y & 1) ret = ret * x;
		x = x * x, y /= 2;
	}
	return ret;
}

记得加上头文件和主函数！！！（不然编译错误别怪我）