help with c++..paste indented cod plzz Q2: There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initially empty. Using these three buckets, we can perform any number of the following two types of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow. Although we may not be able to completely fill the size-M bucket, but we can still determine the maximum amount of milk we can possibly add to largest bucket. Sample input: 17 25 77 Sample output: 76 In this example, we fill the bucket of size 17 three times and then bucket of size 25 once, accumulating a total of 76 units of water. You could use additional test case to test your program: Input: 52 791 877 Output: 843 Input: 26 783 882 Output: 861 Input: 18 46 894 Output: 894
help with c++..paste indented cod plzz
Q2: There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initially empty. Using these three buckets, we can perform any number of the following two types of operations.
We can fill the smallest bucket (of size X) completely to the top with X units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow.
We can fill the medium bucket (of size Y) completely to the top with Y units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow.
Although we may not be able to completely fill the size-M bucket, but we can still determine the maximum amount of milk we can possibly add to largest bucket.
Sample input: 17 25 77
Sample output: 76
In this example, we fill the bucket of size 17 three times and then bucket of size 25 once, accumulating a total of 76 units of water.
You could use additional test case to test your program:
Input: 52 791 877
Output: 843
Input: 26 783 882
Output: 861
Input: 18 46 894
Output: 894
Step by step
Solved in 3 steps with 2 images
