矩阵乘法

csdn_小幻

于 2016-05-07 17:24:28 发布

阅读量248

点赞数

分类专栏：算法矩阵文章标签：数学矩阵

本文链接：https://blog.csdn.net/qq_32401975/article/details/51338928

版权

算法同时被 2 个专栏收录

7 篇文章 0 订阅

订阅专栏

矩阵

3 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <cstdio>
using namespace std;

int matrixOne[100][100], matrixTwo[100][100], matrixThree[100][100];


int main()
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            scanf("%d", &matrixOne[i][j]);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            scanf("%d", &matrixTwo[i][j]);

    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            for (int k = 0; k < n; ++k)
            {
                matrixThree[i][j] += (matrixOne[i][k] * matrixTwo[k][j]);
            }
        }
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
            printf("%d ", matrixThree[i][j]);
        printf("\n");
    }
    return 0;
}