-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path11-2603.c
35 lines (33 loc) · 867 Bytes
/
11-2603.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include<stdio.h>
int main()
{
int i,j,k,l,m,n;
int tensu1[4][3];
int tensu2[3][4];
int sum[4][4]={{0}};
for(i=0;i<4;i++){ /*行列式1*/
printf("请输入行列式1第%d行的值: ",i+1);
for(j=0;j<3;j++){
scanf("%d",&tensu1[i][j]);
}
}
for(i=0;i<3;i++){ /*行列式2*/
printf("请输入行列式2第%d行的值: ",i+1);
for(j=0;j<4;j++){
scanf("%d",&tensu2[i][j]);
}
}
for(k=0,m=0;k<4;k++,m++){
for(j=0,n=0;j<4;j++,n++){
for(l=0,i=0;l<3;i++,l++){
sum[m][n]=sum[m][n]+tensu1[k][l]*tensu2[i][j];
}
}
}
for(m=0;m<4;m++){
for(n=0;n<4;n++){
printf("%4d ",sum[m][n]);
}puts("");
}
return 0;
}