该博客介绍了如何使用递归方法解决Usaco Training中的一道题目，即Mother's Milk。题目涉及三个容量为1到20升的桶，初始时一桶满，两桶空，需要在不浪费牛奶的情况下将奶从一桶倒入另一桶，直至某一桶空。博主通过分析转移状态，给出了利用递归解决此类问题的方法，并提供了C++代码实现。
Farmer John has three milking buckets of capacity A, B, and C liters. Each of the numbers A, B, and C is an integer from 1 through 20, inclusive. Initially, buckets A and B are empty while bucket C is full of milk. Sometimes, FJ pours milk from one bucket to another until the second bucket is filled or the first bucket is empty. Once begun, a pour must be completed, of course. Being thrifty, no milk may be tossed out.
Write a program to help FJ determine what amounts of milk he can leave in bucket C when he begins with three buckets as above, pours milk among the buckets for a while, and then notes that bucket A is empty.
PROGRAM NAME: milk3
INPUT FORMAT
A single line with the three integers A, B, and C.
SAMPLE INPUT (file milk3.in)
8 9 10
OUTPUT FORMAT
A single line with a sorted list of all the possible amounts o
最低0.47元/天 解锁文章
473
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
