๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
๊ฐœ์ธ๊ณต๋ถ€/Algorithm

[๋ฐฑ์ค€][Node.js] 2740๋ฒˆ : ํ–‰๋ ฌ ๊ณฑ์…ˆ

by ๐Ÿ‡๋ฐ•๋ด‰๋ด‰๐Ÿ‡ 2021. 9. 11.

 

 

Algorithm

-  ํ–‰๋ ฌ ๊ณฑ์…ˆ -

 


 

๋ฌธ์ œ

N*Mํฌ๊ธฐ์˜ ํ–‰๋ ฌ A์™€ M*Kํฌ๊ธฐ์˜ ํ–‰๋ ฌ B๊ฐ€ ์ฃผ์–ด์กŒ์„ ๋•Œ, ๋‘ ํ–‰๋ ฌ์„ ๊ณฑํ•˜๋Š” ํ”„๋กœ๊ทธ๋žจ์„ ์ž‘์„ฑํ•˜์‹œ์˜ค.

 

์ž…์ถœ๋ ฅ ์˜ˆ์‹œ

 

๋ฌธ์ œ ํ’€๊ธฐ

const readline = require("readline");
const rl = readline.createInterface({
	input: process.stdin,
	output: process.stdout,
});
let input = [];
rl.on("line", function (line) {
	input.push(
		line
			.toString()
			.split(" ")
			.map((el) => +el)
	);
}).on("close", function () {
	let size = input.shift();
	let hang1 = input.splice(0, size[0]);
	size = input.shift();
	let hang2 = input.splice(0, size[0]);
	let result = [];

	for (let i = 0; i < hang1.length; i++) {
		let value = [];
		for (let j = 0; j < hang2[0].length; j++) {
			let gop = hang1[i].map((el, idx) => el * hang2[idx][j]);
			let sum = gop.reduce((past, curr) => past + curr, 0);
			value.push(sum);
		}
		result.push(value.join(" "));
	}
	console.log(result.join("\n"));
	process.exit();
});

 

 

 

๋ฐ˜์‘ํ˜•

๋Œ“๊ธ€