Pro.ID10120 TitleMother's Milk Title链接http://10.20.2.8/oj/exercise/problem?problem_id=10120 AC57 Submit150 Ratio38.00% 时间&空间限制描述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. 输入Multiple test cases. Every case is a single line with the three integers A, B, and C. 输出Description 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. Input Multiple test cases. Every case is a single line with the three integers A, B, and C. Output For every case, output a single line with a sorted list of all the possible amounts of milk that can be in bucket C when bucket A is empty. Sample Input 8 9 10 Sample Output 1 2 8 9 10 Source 样例输入8 9 10 样例输出1 2 8 9 10 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-1-31 11:04 , Processed in 0.015482 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
