#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#define row 3
#define col 3
#define mid 4
int main()
{
int arr1[row][mid] = { 0 };
int arr2[mid][col] = { 0 };
int arr3[row][col] = { 0 };
int i = 0;
int j = 0;
int m = 0;
printf("第一个矩阵\n");
for (i = 0; i < row; i++)
{
printf("第一个矩阵的%d行\n", i);
for (j = 0; j < mid; j++)
{
scanf("%d", &arr1[i][j]);
}
}
printf("第二个矩阵\n");
for (i = 0; i < mid; i++)
{
printf("第二个矩阵第%d行\n", i);
for (j = 0; j < col; j++)
{
scanf("%d", &arr2[i][j]);
}
}
printf("第三个矩阵:\n");
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
int sum = 0;
for (m = 0; m < mid; m++)
{
sum = sum + arr1[i][m] * arr2[m][j];
}
arr3[i][j] = sum;
}
}
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
printf("%3d", arr3[i][j]);
}
printf("\n");
}
system("pause");
return 0;
}
两个大小不定的整形矩阵,相乘后输出结果其结果
猜你喜欢
转载自blog.csdn.net/weixin_43291743/article/details/89073037
今日推荐
周排行