试题 基础练习 矩阵乘法
资源限制
时间限制:1.0s 内存限制:512.0MB
问题描述
给定一个N阶矩阵A,输出A的M次幂(M是非负整数)
例如:
A =
1 2
3 4
A的2次幂
7 10
15 22
输入格式
第一行是一个正整数N、M(1<=N<=30, 0<=M<=5),表示矩阵A的阶数和要求的幂数
接下来N行,每行N个绝对值不超过10的非负整数,描述矩阵A的值
输出格式
输出共N行,每行N个整数,表示A的M次幂所对应的矩阵。相邻的数之间用一个空格隔开
样例输入
2 2##### 样例输出
1 2
3 4
7 10
15 22
实现代码
#include<iostream>
#include<cstring>
using namespace std;
int n, m;
struct Martix {
int m[30][30];
Martix() {}
Martix(int judge) {
memset(m, 0, sizeof(m));
if(judge) for (int i = 1; i <= n; i++) m[i][i] = 1;
}
}martix, ans;
void mul() {
Martix temp(0);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for (int k = 1; k <= n; k++)
temp.m[i][j] += ans.m[i][k] * martix.m[k][j];
ans = temp;
}
void output(Martix mar) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
{
if (j != 1) cout << " ";
cout << mar.m[i][j];
}
cout << endl;
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cin >> martix.m[i][j]; ans = martix;
if (m == 0) output(Martix(1)), exit(0);
for (int i = 2; i <= m; i++) mul();
output(ans);
return 0;
}