题解

# 读取输入的三个骰子面数
s1, s2, s3 = map(int, input().split())

# 初始化统计数组，和的范围是 3 (1+1+1) 到 s1+s2+s3
max_sum = s1 + s2 + s3
count = [0] * (max_sum + 1)  # 索引对应和的值

# 遍历所有可能的组合
for i in range(1, s1 + 1):
    for j in range(1, s2 + 1):
        for k in range(1, s3 + 1):
            total = i + j + k
            count[total] += 1

# 找到最大出现次数
max_count = max(count)

# 找到出现次数等于max_count的最小和
result = 0
for total in range(3, max_sum + 1):
    if count[total] == max_count:
        result = total
        break

# 输出结果
print(result)