1498. Mother's Milk

单点时限: 2.0 sec

内存限制: 256 MB

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.

输入格式

There are several test cases,one test case one line contains three integers A, B, and C.

输出格式

One case one line with a sorted list of all the possible amounts of milk that can be in bucket C when bucket A is empty.

样例

Input
8 9 10
Output
1 2 8 9 10

8 人解决,15 人已尝试。

8 份提交通过,共有 24 份提交。

6.9 EMB 奖励。

创建: 17 年,4 月前.

修改: 7 年,3 月前.

最后提交: 1 年,5 月前.

来源: USACO

题目标签