题解 | #矩阵乘法# 优雅解法

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void (async function () {
    const n = parseInt(await readline());
    const k = parseInt(await readline());
    const m = parseInt(await readline());
    const one = [],
        two = [];
    const res = Array.from(Array(n),()=>Array(m).fill(0))
    for (let i = 0; i < n; i++) {
        one.push((await readline()).split(" ").map(Number));
    }
    for (let i = 0; i < k; i++) {
        two.push((await readline()).split(" ").map(Number));
    }
    for (let index = 0; index < k; index++) {
        for (let i = 0; i < n; i++) {
            for (let j = 0; j < m; j++) {
                res[i][j] += one[i][index]*two[index][j];
            }
        }
    }
    console.log(res.map(item=>item.join(" ")).join("\n"));
})();