AtCoder Beginner Contest 093 C Same Integers (贪心水题)

最新推荐文章于 2025-01-12 20:35:02 发布

原创

最新推荐文章于 2025-01-12 20:35:02 发布 · 598 阅读

0 ·

CC 4.0 BY-SA版权

博客详细介绍了AtCoder Beginner Contest 093中C题的解题思路，重点在于利用贪心算法解决如何通过有限次操作使三个数字相等的问题。操作包括将两个数字加1或一个数字加2。文章通过代码展示了具体的实现细节。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

C - Same Integers
Time limit : 2sec / Memory limit : 256MB

Score : 300 points

Problem Statement
You are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:

Choose two among A, B and C, then increase both by 1.
Choose one among A, B and C, then increase it by 2.
It can be proved that we can always make A, B and C all equal by repeatedly performing these operations.

Constraints
0≤A,B,C≤50
All values in input are integers.
Input
Input is given from Standard Input in the following format:

A B C
Output
Print the minimum number of operations required to make A, B and C all equal.

Sample Input 1

2 5 4
Sample Output 1

2
We can make A, B and C all equal by the following operations:

Increase A and C by