[백준/파이썬] 1233번 주사위

-코드

s1, s2, s3 = map(int, input().split())
arr = [0] * (s1 + s2 + s3 + 1)
for i in range(1, s1 + 1):
    for j in range(1, s2 + 1):
        for k in range(1, s3 + 1):
            arr[i + j + k] += 1
for i in range(len(arr)):
    if arr[i] == max(arr):
        print(i)
        break