You know those decanting-problems, where you have two jugs of different sizes, and a water fountain, and you need to get a specific amount of water into one of the jugs using the smallest number of transfers? I came up with a decanting problem like that, but then it turned out that there were two solutions tied for "smallest number of transfers".
In those solutions, how full did the larger jug end up?
CLARIFICATION: In problems of this sort, it doesn't matter which jug ends up containing the target volume.