#include <stdio.h>
#include <math.h>
void product(int n, int m, int p, double A[][100], double B[][100], double C[][100]);
int main() {
double A[100][100]={}, B[100][100]={};
double C[100][100]={}; //C=A*B
int n, m, p;
scanf("%d%d%d", &n, &m, &p);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
scanf("%lf", &A[i][j]);
}
}
for(int i = 1; i <= m; i++){
for(int j = 1; j <= p; j++){
scanf("%lf", &B[i][j]);
}
}
product(n, m, p, A, B, C);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= p; j++){
printf("%lf ", C[i][j]);
}
printf("\n");
}
return 0;
}
void product(int n, int m, int p, double A[][100], double B[][100], double C[][100]){
for (int i=1; i<=n; i++) {
for (int j=1; j<=p; j++) {
for (int k=1; k<=m; k++) {
C[i][j] += A[i][k] * B[k][j];
}
}
}
return;
}
矩阵的乘法
最新推荐文章于 2024-10-02 16:39:03 发布