第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-86 矩阵乘法

#include <stdio.h>

int main(int argc, const char * argv[]) {
    int m,s,n,i,j,k,temp;
    scanf("%d %d %d",&m,&s,&n);
    int matrix1[m][s],matrix2[s][n],ans[m][n];
    for (i=0; i<m; i++) {
        for (j=0; j<s; j++) {
            scanf("%d",&matrix1[i][j]);
        }
    }
    for (i=0; i<s; i++) {
        for (j=0; j<n; j++) {
            scanf("%d",&matrix2[i][j]);
        }
    }
    for (i=0; i<m; i++) {
        for (j=0; j<n; j++) {
            temp = 0;
            for (k=0; k<s; k++) {
                temp += matrix1[i][k] * matrix2[k][j];
            }
            ans[i][j] = temp;
            printf("%d ",ans[i][j]);
        }
        printf("\n");
    }
    return 0;
}

#include<stdio.h>
int main()
{
	int a[210][210]={0},b[210][210]={0},c[210][210]={0};
	int m=0,s=0,n=0,i=0,j=0,k=0;
	scanf("%d %d %d",&m,&s,&n);
	for(i=1;i<=m;i++)
		for(j=1;j<=s;j++)
            scanf("%d",&a[i][j]);
    for(i=1;i<=s;i++)
        for(j=1;j<=n;j++)
            scanf("%d",&b[i][j]);
    
    for(i=1;i<=m;i++)
        for(j=1;j<=n;j++)
            for(k=1;k<=s;k++)
                c[i][j]+=a[i][k]*b[k][j];
    
    for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++)
            {
            	printf("%d ",c[i][j]);
			}
		printf("\n");	
	}
	return 0;
 }

import java.io.*;

public class Main{
	
	public static void main(String[] args) throws IOException{
		StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		
		in.nextToken();
		int m = (int)in.nval;
		in.nextToken();
		int s = (int)in.nval;
		in.nextToken();
		int n = (int)in.nval;
		int[][] a = new int[m][s];
		int[][] b = new int[s][n];
		
		for(int i = 0 ; i < m; i++) {
			for(int j = 0 ; j < s; j++) {
				in.nextToken();
				a[i][j] = (int)in.nval;
			}
		}
		
		for(int i = 0 ; i < s; i++) {
			for(int j = 0 ; j < n; j++) {
				in.nextToken();
				b[i][j] = (int)in.nval;
			}
		}
		
		int[][] ans = new int[m][n];
		for(int i = 0 ; i < m; i++) {
			for(int j = 0 ; j < n; j++) {
				ans[i][j] = 0;
				for(int k = 0 ; k < s; k++) {
					ans[i][j] += a[i][k]*b[k][j];
				}
			}
		}
		
		for(int i = 0 ; i < m ; i++) {
			for(int j = 0 ; j < n ; j++) {
				if(j == 0) {
					out.print(ans[i][j]);
				}else {
					out.print(" "+ans[i][j]);
				}
			}
			out.println();
		}
		
		out.flush();
	}
}

def matmul(A,B):
    def transpose(mat):
        mat_t = []
        for row in zip(*mat):
            mat_t.append(list(row))
        return mat_t
    return [[sum(a * b for a, b in zip(*a, *b)) for b in zip(transpose(B))] for a in zip(A)]

list1=[]
m,s,n=map(int,input().split())
for i in range(m+s):
    list1.append(list(map(int, input().split())))
a=list1[:m]
b=list1[m:]
lc=matmul(a,b)
for i in lc:
    for j in i:
        print(j,end=' ')
    print()