Bronze-2018Dec-Mixing Milk

最新推荐文章于 2024-09-15 11:40:06 发布

xy404chef

最新推荐文章于 2024-09-15 11:40:06 发布

阅读量245

点赞数

分类专栏： USACO_铜文章标签： c++

本文链接：https://blog.csdn.net/caonimabidenichen/article/details/126448753

版权

这道题目描述了农夫John如何将三头奶牛的牛奶混合，通过在三个不同大小的桶之间倒牛奶进行混合，共进行100次操作。在每次倒牛奶的过程中，会尽可能倒满或倒空一个桶。程序需要计算经过100次操作后，每个桶中剩余的牛奶量。

摘要由CSDN通过智能技术生成

Fortunately, Farmer John has a good idea. His three prize dairy cows Bessie, Elsie, and Mildred each produce milk with a slightly different taste, and he plans to mix these together to get the perfect blend of flavors.

To mix the three different milks, he takes three buckets containing milk from the three cows. The buckets may have different sizes, and may not be completely full. He then pours bucket 1 into bucket 2, then bucket 2 into bucket 3, then bucket 3 into bucket 1, then bucket 1 into bucket 2, and so on in a cyclic fashion, for a total of 100 pour operations (so the 100th pour would be from bucket 1 into bucket 2). When Farmer John pours from bucket aa into bucket bb, he pours as much milk as possible until either bucket aa becomes empty or bucket bb becomes full.

Please tell Farmer John how much milk will be in each bucket after he finishes all 100 pours.

INPUT FORMAT (file mixmilk.in):

The first line of the input file contains two