MATRIX MULTIPLICATION CALCULATOR - ICPC 2018 Malaysia

时间限制: 1 Sec 内存限制: 128 MB

题目描述

Matrix multiplication is a basic tool of linear algebra, and has numerous applications in many areas of mathematics, as well as in applied mathematics, computer graphics, physics, and engineering.
We can only multiply two matrices if their dimensions are compatible, which means the number of columns in the first matrix is the same as the number of rows in the second matrix.
If A = [aij ] is an m×n matrix and B = [bij ] is an n×q matrix, the product AB is an m×q matrix.
The product AB is defined to be the m×q matrix C = [cij ] such that

Your task is to design a matrix multiplication calculator to multiply two matrices and display the output. If the matrices cannot be multiplied, display “undefined”

输入

The input consists of a few test cases. For each test case, the first line of input is 4 positive integers, M, N, P and Q (1 ≤ M, N, P, Q ≤ 20). M and N represent the dimension of matrix A, while P and Q represent the dimension of matrix B. The following M lines consist of the data for
matrix A followed by P lines that contains the data for matrix B as shown in the sample input.
The test data ends when M, N, P and Q are 0.

输出

For each test case, the output contains a line in the format “Case #x:”, where x is the case number (starting from 1). The following line(s) is the output of the matrix multiplication.

样例输入

2 3 3 2
1 2 3
3 2 1
4 5
6 7
8 9
2 3 2 3
1 2 3
3 2 1
4 5 6
7 8 9
0 0 0 0

样例输出

Case #1:
| 40 46 |
| 32 38 |
Case #2:
undefined

#include<bits/stdc++.h>
using namespace std;
int m,n,p,q;
int a[25][25],b[25][25];
int main()
{
    int t=1;
    while(1){
    	cin>>m>>n>>p>>q;
	    if(m==0||n==0||p==0||q==0) return 0;
        for(int i=0;i<m;i++){
    	    for(int j=0;j<n;j++){
    		    cin>>a[i][j];
		    }
	    } 
	    for(int i=0;i<p;i++){
		    for(int j=0;j<q;j++){
			    cin>>b[i][j];
		    }
	    }
	    printf("Case #%d:\n",t);
	    if(n==p){
		    for(int i=0;i<m;i++){
			    printf("| ");
		    	for(int j=0;j<q;j++){
				    int c=0;
		    		for(int k=0;k<n;k++)
		    		    c+=a[i][k]*b[k][j];
				    printf("%d ",c);
				}
				printf("|\n");
			}
	    }else printf("undefined\n");
	    t++;
	}
}