矩阵乘法

    xiaoxiao2022-06-29  44

    #include<stdio.h> int main() { int a[2][2] = {{ 1, 1}, { 2, 0}}; int b[2][3] = {{ 0, 2, 3}, { 1, 1, 2}}; int i, j, k, s[2][3] = {0}; for (i = 0; i < 2; i++) { for (j =0; j < 3; j++) { for (k = 0; k < 2; k++)//矩阵a的列数和矩阵b的行数相等为k时 { s[i][j] = s[i][j] + a[i][k] * b[k][j]; } } } for (i = 0;i < 2; i++) for (j = 0; j < 3; j++) { printf("%d ", s[i][j]); if (j == 2) printf("\n"); } return 0; }
    转载请注明原文地址: https://ju.6miu.com/read-1125485.html

    最新回复(0)