본문 바로가기
알고리즘/백준

백준-2566번(최댓값)-python

by nyeongha 2023. 11. 23.

백준-2566번(최댓값)-python

line=[]

for i in range(9):
    line.append(list(map(int,input().split())))

max_value = max(map(max, line))

print(max_value)

for i in range(9):
    for j in range(9):
        if line[i][j] == max_value:
            print(i+1,j+1)
l = sum([list(map(int, input().split())) for _ in range(9)],[])
m= max(l)
mi = l.index(m)
print(m)
print(mi// 9 + 1, mi% 9 + 1)