#include<stdio.h>
#include<stdlib.h>
int** matrix_init(int i_m,int j_m) {
int i, j;
int** arr = (int**)malloc(i_m *sizeof(int*));
if (arr == NULL) {
printf("\n申请纵向空间失败!");
return NULL;
}
for (i = 0; i < i_m; i++) {
arr[i] = (int*)malloc(j_m * sizeof(int));
if (arr[i] == NULL) {
printf("\n申请第%d行空间失败!", i + 1);
for (j = 0; j < i; j++) {
free(arr[j]);
}
return NULL;
}
}
return arr;
}
int** matrix_generate(int i_m, int j_m) {
int i, j;
int** arr = matrix_init(i_m, j_m);
for (i = 0; i < i_m; i++) {
for (j = 0; j < j_m; j++) {
printf("请输入矩阵中元素arr[%d][%d]的数值 : ", i + 1, j + 1);
scanf_s("%d",&(arr[i][j]));
getchar();
}
}
return arr;
}
int** matrix_tow_mulp(int** matrix1,int** matrix2,int i_m1,int j_m1,int i_m2,int j_m2) {
if (j_m1 != i_m2) {
return NULL;
}
int** arr = matrix_init(i_m1,j_m2);
int i, j,z;
for (i = 0; i < i_m1; i++) {
for (z = 0; z < j_m2; z++) {
arr[i][z] = 0;
for (j = 0; j < j_m1; j++) {
arr[i][z] = arr[i][z]+ (matrix1[i][j] * matrix2[j][z]);
}
}
}
return arr;
}
void show_matrix(int mi, int mj,int** arr) {
printf("\n");
int i, j;
for (i = 0; i < mi; i++) {
for (j = 0; j < mj; j++) {
printf("%d ", arr[i][j]);
}
printf("\n");
}
}
void free_map(int** arr,int im) {
for (int i = 0; i < im; i++) {
free(arr[i]);
}
free(arr);
}
int main() {
int i_m1, j_m1, i_m2, j_m2;
printf("请输入第一个矩阵的行列数i j :");
scanf_s("%d %d",&i_m1,&j_m1,4);
getchar();
int** matrix1 = matrix_generate(i_m1,j_m1);
if (!matrix1) {
printf("\n矩阵生成失败!");
return 0;
}
show_matrix(i_m1, j_m1, matrix1);
printf("\n请输入第二个矩阵的行列数i j :");
scanf_s("%d %d", &i_m2, &j_m2, 4);
getchar();
int** matrix2 = matrix_generate(i_m2, j_m2);
if (!matrix2) {
printf("\n矩阵生成失败!");
return 0;
}
show_matrix(i_m2, j_m2, matrix2);
printf("\n");
int** arr_mulp = matrix_tow_mulp(matrix1,matrix2,i_m1,j_m1,i_m2,j_m2);
printf("\n");
if (!arr_mulp) {
printf("无法完成矩阵乘法!");
return 0;
}
show_matrix(i_m1,j_m2,arr_mulp);
free_map(matrix1,i_m1);
free_map(matrix2,i_m2);
free_map(arr_mulp,i_m1);
return 0;
}