题解 | #矩阵乘法#

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

void (async function () {
    // Write your code here
    let arrinput = [];
    while ((line = await readline())) {
        arrinput.push(line);
    }
    let rA = +arrinput.shift();
    let cA = (rB = +arrinput.shift());
    let cB = +arrinput.shift();
    // console.log(rA, cA, rB, cB);
    let arrA = [];
    let arrB = [];
    for (let i = 0; i <= rA - 1; i++) {
        arrA.push(arrinput.shift());
    }
    // console.log(arrA);
    arrA.forEach((item, index) => {
        arrA[index] = item.split(" ");
    });
    // console.log(arrA);
    for (let i = 0; i <= rB - 1; i++) {
        arrB.push(arrinput.shift());
    }
    // console.log(arrB)
    arrB.forEach((item, index) => {
        arrB[index] = item.split(" ");
    });
    // console.log(arrB);
    let sum;
    let arrresult=[];
    for (let i = 0; i <= rA - 1; i++) {
        for (let j = 0; j <= cB - 1; j++) {
            sum=0;
            for (let k = 0; k <= rB - 1; k++) {
                // console.log(arrA[i][k], arrB[k][j]);
                sum += arrA[i][k] * arrB[k][j];
            }
            // console.log(sum);
            arrresult.push(sum);
        }
    }
    // console.log(arrresult)
    const len=arrresult.length;
    for(let i=0;i<len;i+=cB){
        // console.log(arrresult)
        console.log(arrresult.splice(0,cB).join(' '));
    }
})();