chills0000
✅ Problem with creating algorithm - here is the description: (thank you for any help)
Let us have three cups of integer sizes a, b, c (a, b, c not greater than 10) containing at the beginning x, y, z of water, respectively.
We can transfer the water from one cup to other until the cup to is full or the cup from is empty.
It is not possible to throw the water out as well as take water from some external source.
Input of the program are numbers a, b, c, x, y, z giving the sizes and starting volumes of cups.
Program will print the list of all volumes (including zero, if possible) obtainable by transfers (the whole volume must be contained in one cup) and for each of those volumes it prints ":" (colon) and minimal number of transfers needed. Volumes would be printed in ascending order.
Example:
Input:
4 1 1 1 1 1
Output:
0:1 1:0 2:1 3:2.
127 replies