BOJ / 2740번 / 행렬 곱셈 [Go][Python3]

👩🏻‍💻 문제

2740번: 행렬 곱셈

---

✍🏻 풀이

🎨 Go

// https://www.acmicpc.net/problem/2740
// 행렬의 거듭제곱을 계산하기 전에 먼저 풀어야 할 문제
package main

import (
	"bufio"
	"fmt"
	"os"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	writer := bufio.NewWriter(os.Stdout)
	defer writer.Flush()

	var n, m, k int
	fmt.Fscanln(reader, &n, &m)

	var a = make([][]int, n)
	for i := 0; i < n; i++ {
		a[i] = make([]int, m)
		for j := 0; j < m; j++ {
			fmt.Fscanf(reader, "%d ", &a[i][j])
		}
	}

	fmt.Fscanln(reader, &m, &k)
	var b = make([][]int, m)
	for i := 0; i < m; i++ {
		b[i] = make([]int, k)
		for j := 0; j < k; j++ {
			fmt.Fscanf(reader, "%d ", &b[i][j])
		}
	}
	var result = make([][]int, n)
	for i := 0; i < n; i++ {
		result[i] = make([]int, k)
		for j := 0; j < k; j++ {
			for l := 0; l < m; l++ {
				result[i][j] += a[i][l] * b[l][j]
			}
		}
	}

	for i := 0; i < n; i++ {
		for j := 0; j < k; j++ {
			fmt.Fprintf(writer, "%d ", result[i][j])
		}
		fmt.Fprintln(writer, "")
	}
}

🎨 Python3

# https://www.acmicpc.net/problem/2740
# 행렬의 거듭제곱을 계산하기 전에 먼저 풀어야 할 문제
import sys

if __name__ == "__main__":
    n, m = list(map(int, sys.stdin.readline().split()))
    a = []
    for i in range(n):
        a.append(list(map(int, sys.stdin.readline().split())))

    m, k = list(map(int, sys.stdin.readline().split()))
    b = []
    for i in range(m):
        b.append(list(map(int, sys.stdin.readline().split())))

    result = [[0 for i in range(k)] for j in range(n)]
    for i in range(n):
        for j in range(k):
            for l in range(m):
                result[i][j] += a[i][l] * b[l][j]
    
    for i in range(n):
        for j in range(k):
            print("{} ".format(result[i][j]), end='')
        print()