Codeforces:Three Piles of Candies

最新推荐文章于 2024-07-17 18:07:42 发布

a Rangers

最新推荐文章于 2024-07-17 18:07:42 发布

阅读量85

点赞数 1

文章标签： c++

本文链接：https://blog.csdn.net/m0_72354367/article/details/128435883

版权

原题网址

A. Three Piles of Candies
time limit per test 1 second
memory limit per test 256 megabytes
input standard input
output standard output

Alice and Bob have received three big piles of candies as a gift. Now they want to divide these candies as fair as possible. To do this, Alice takes one pile of candies, then Bob takes one of the other two piles. The last pile is split between Alice and Bob as they want: for example, it is possible that Alice takes the whole pile, and Bob gets nothing from it.
After taking the candies from the piles, if Alice has more candies than Bob, she discards some candies so that the number of candies she has is equal to the number of candies Bob has. Of course, Bob does the same if he has more candies.
Alice and Bob want to have as many candies as possible, and they plan the process of dividing candi