零分求调
查看原帖
零分求调
588080
n_bluetea楼主2023/1/7 02:07
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
using namespace std;
const int MAX = 100;
const int mod = 1e9 + 7;

struct matrix
{
	long long m[MAX][MAX];
};

long long n;
matrix operator * (const matrix& a, const matrix& b)
{
	matrix c;
	memset(c.m, 0, sizeof(c));

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

matrix pow_matrix(matrix a, int pow)
{
	matrix ans;
	memset(ans.m, 0, sizeof(ans.m));

	for (int i = 0; i < n; i++)
	{
		ans.m[i][i] = 1;
	}

	while (pow)
	{
		if (pow & 1)
		{
			ans = ans * a;
		}

		a = a * a;
		pow /= 2;
	}
	return ans;
}

int main()
{
	long long k;
	cin >> n >> k;

	matrix a;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> a.m[i][j];
		}
	}

	matrix ans = pow_matrix(a, k);

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cout << a.m[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}
2023/1/7 02:07
加载中...