백준문제/브론즈 5

백준) 4673번 - python

kiseno 2024. 2. 18. 21:43
728x90
반응형
SMALL
mid, final, coderess = [],[],[]
for i in range(9):
    a = list(map(int, input().split()))
    mid.append(a)
    for j in range(len(mid)):
        if mid[i][j] == max(mid):
            final.append(max(mid))
            coderess.append(i)
            coderess.append(j)

print(mid)
print(max(mid))
print(coderess)
728x90
반응형
LIST