백준 알고리즘 - 2566. 최댓값

https://www.acmicpc.net/problem/2566

2566번: 최댓값

 

전체 코드

def solution(mat: list[list]):
    max_row, max_col, max_val = 0, 0, 0
    for row in range(len(mat)):
        for col in range(len(mat[0])):
            if max_val <= mat[row][col]:
                max_row, max_col, max_val = row + 1, col + 1, mat[row][col]

    return max_val, max_row, max_col


# --- submit ---
mat = []
for _ in range(9):
    mat.append(list(map(int, input().split(' '))))
val, row, col = solution(mat)
print(val)
print(f'{row} {col}')