3712. Matrix multiplication

最新推荐文章于 2022-09-05 21:51:01 发布

Here_I_Come

最新推荐文章于 2022-09-05 21:51:01 发布

阅读量695

点赞数

本文链接：https://blog.youkuaiyun.com/Here_I_Come/article/details/8711747

版权

本文介绍了一个简单的矩阵乘法算法实现，该算法能够处理大小为 n*n 的两个矩阵 A 和 B 的相乘运算，并通过示例展示了输入输出格式。文章提供了一段 C++ 代码示例，用于帮助理解矩阵乘法的具体实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

3712. Matrix multiplication

Constraints

Time Limit: 1 secs, Memory Limit: 256 MB

Description

Given two n*n matrices, A and B, computes its matrices multiplication C=A∙B.

Input

There are multiples test cases. Each case is:

The first line is an integer n(<=10), meaning the size of the matrix. For the following 2*n lines, each line contains n integers. The first n lines contain the elements in matrix A.

Input is terminated by EOF.

Output

For each test case, output:

The multiplication C= A∙B, there will be n lines and each line contains n integers, separating the integers by a space.

Sample Input

1 2

3 4

1 1

Sample Output

3 3

7 7

Hint

//To process multiple cases, you can use some C++ codes like:
//original codes:
//    cin >> a >> b;
//      cout << a + b << endl;
while(cin >> a){
    cin >> b;
    cout << a + b << endl;
}

//or use some C codes like:
//original codes:
//    scanf("%d%d", &a, &b);
//    printf("%d\n", a + b);
while(scanf("%d", &a) != EOF){
    scanf("%d", &b);
    printf("%d\n", a + b);
}