We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 78077ba + bab39b8 commit 83d0350Copy full SHA for 83d0350
.gitignore
@@ -1,2 +1,3 @@
1
*.exe
2
+*.out
3
*.o
Array Questions/matrix_multiplication.c
@@ -19,8 +19,8 @@ int main(int argc, char *argv[]) {
19
exit(EXIT_FAILURE);
20
} else {
21
if (column1 != row2) {
22
- // check to see if the number of rows of first matrix is equal to the
23
- // number of columns of second matrix;
+ // check to see if the number of column of first matrix is equal to the
+ // number of rows of second matrix;
24
printf("Number of column of first matrix must be equal the row of second "
25
"matrix.\n");
26
@@ -69,7 +69,7 @@ int mult_matrix(int row1, int column1, int row2, int column2) {
69
}
70
71
// muliplied matrix
72
- // printf("Result of the product of those two matrixes\n");
+ printf("Result of the product of those two matrixes\n");
73
for (int i = 0; i < row1; i++) {
74
for (int j = 0; j < column2; j++) {
75
printf("%d\t", result[i][j]);
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments