# P2911 [USACO08OCT]牛骨头Bovine Bones

• 6.9K通过
• 13K提交
• 题目提供者 FarmerJohn2
• 评测方式 云端评测
• 标签 USACO 2008
• 难度 入门难度
• 时空限制 1000ms / 128MB
• 提示：收藏到任务计划后，可在首页查看。

## 题意翻译

贝西喜欢玩桌上扮演游戏（BRPG），所以她说服农场主约翰开车送她到商店，在那里她买了三个骰子。

这三个骰子分别有S1、S2和S3个面。每个有S面的骰子每一面的点数分别是1,2,3……,S-1,S.

贝西每次同时扔出三个骰子，她一直扔呀扔，试图找出三个骰子点数之和哪个出现的次数最多。

现在给定三个骰子中每个骰子的面数，求三个骰子的点数和哪个最频繁出现。如果有多解，输出最小的一个。

数据范围： （2＜S1<＝20；2 <＝S2<＝20；2 <＝S3<＝40）

## 题目描述

Bessie loves board games and role-playing games so she persuaded Farmer John to drive her to the hobby shop where she purchased three dice for rolling. These fair dice have S1, S2, and S3 sides

respectively (2 <= S1 <= 20; 2 <= S2 <= 20; 2 <= S3 <= 40).

Bessie rolls and rolls and rolls trying to figure out which three-dice sum appears most often.

Given the number of sides on each of the three dice, determine which three-dice sum appears most frequently. If more than one sum can appear most frequently, report the smallest such sum.

POINTS: 70

## 输入输出格式

输入格式：

* Line 1: Three space-separated integers: S1, S2, and S3

输出格式：

* Line 1: The smallest integer sum that appears most frequently when the dice are rolled in every possible combination.

## 输入输出样例

输入样例#1： 复制
3 2 3

输出样例#1： 复制
5


## 说明

Here are all the possible outcomes.

1 1 1 -> 3 1 2 1 -> 4 2 1 1 -> 4 2 2 1 -> 5 3 1 1 -> 5 3 2 1 -> 6 1 1 2 -> 4 1 2 2 -> 5 2 1 2 -> 5 2 2 2 -> 6 3 1 2 -> 6 3 2 2 -> 7 1 1 3 -> 5 1 2 3 -> 6 2 1 3 -> 6 2 2 3 -> 7 3 1 3 -> 7 3 2 3 -> 8

Both 5 and 6 appear most frequently (five times each), so 5 is the answer.

提示
标程仅供做题后或实在无思路时参考。
请自觉、自律地使用该功能并请对自己的学习负责。
如果发现恶意抄袭标程，将按照I类违反进行处理。