#include<stdio.h>
#include<iostream>
using namespace std;
#define Length 3
int * MatrixMultiply(int numa[][Length], int numb[2][Length], int n);//直接计算
//void MatrixMultiplyRecursive(int numa[][Length], int numb[][Length], int n); //递归分治
int main ()
{
int numa[Length][Length] = {{1, 2, 3}, {2, 3, 1}, {3, 2, 1}};
int numb[Length][Length] = {{2, 3, 1}, {3, 1, 2}, {1, 3, 2}};
MatrixMultiply(numa, numb, Length);
//MatrixMultiplyRecursive(numa, numb, Length);
}
//矩阵乘法:A的第i行各元素与B的第j行列各的元素相乘得到C中的第i行第j列的元素
int * MatrixMultiply(int numa[][Length], int numb[][Length], int n)
{
int numc[n][n];
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
numc[i][j] = 0;//对结果矩阵中的元素进行初始化
for(int k = 0; k < n; k++)
{
numc[i][j] += numa[i][k] * numb[k][j];//此时变化的只有k
}
}
}
cout << "相乘矩阵结果为:" << endl;
for(int k = 0; k < n; k++)
{
for(int t = 0; t < n; t++)
cout << numc[k][t] << " ";
cout << endl;
}
return numc[3][3];
}