蓝桥杯-矩阵相乘

"""
https://www.lanqiao.cn/problems/1550/learning/?page=1&first_category_id=1&problem_id=1550
"""
import os
import sys
# 两个矩阵相乘
def mul(A, B):
    N, M1 = len(A), len(A[0])
    M2, K = len(B), len(B[0])
    if M1 != M2:
        return False
    # 矩阵相乘: A(N, M) * B(M, K) = C(N, K)
    C = [[0] * K for i in range(N)]
    for i in range(N):
        for j in range(K):
            # C[i][j]为矩阵A第i行和矩阵B第j列上数字乘积之和
            for k in range(M):
                C[i][j] += A[i][k] * B[k][j]
    return C

# 读入和输出矩阵
def read(A, n):
    for i in range(n):
        A.append(list(map(int, input().split())))
def ouput(A):
    for x in A:
        print(' '.join(map(str, x)))

A = []
B = []
N, M, K = map(int, input().split())
read(A, N)
read(B, M)

C = mul(A, B)
ouput(C)