C# console application

If one of the buckets has a denomination of 'X', then clearly you can do it one step.

Otherwise you have to consider all the possible sums of 2 buckets with denominations less than 'X' to see if there is a sum which equals X. If so, then you can do it in two steps.

If there isn't such a sum, then you have to consider the possible sums of 3 buckets and so on until (hopefully) you find a combination which equals 'X'.

However, it's quite possible that there won't be a combination which adds up to 'X'. If that's the case, then the question doesn't make it clear what you're supposed to do. In some cases, you'd be able to make up the shortfall by using part of one of the other buckets; in other cases you wouldn't be able to do this and so would have to refill one or more of the buckets.

1 Reply

Know the answer? Post it — somebody with the same question will find it here.

Vulpes14y ago
If one of the buckets has a denomination of 'X', then clearly you can do it one step.

Otherwise you have to consider all the possible sums of 2 buckets with denominations less than 'X' to see if there is a sum which equals X. If so, then you can do it in two steps.

If there isn't such a sum, then you have to consider the possible sums of 3 buckets and so on until (hopefully) you find a combination which equals 'X'.

However, it's quite possible that there won't be a combination which adds up to 'X'. If that's the case, then the question doesn't make it clear what you're supposed to do. In some cases, you'd be able to make up the shortfall by using part of one of the other buckets; in other cases you wouldn't be able to do this and so would have to refill one or more of the buckets.