Welcome to the new platform of Programmers Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use it's exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
Is there a concrete algorithm to solving the water jug problem?
For 3 jugs, each of different capacities, and a target value (all integers).
Does an algorithm exist? If so, what is it?
Also, what is the best type of variable to use for the water jugs in c++?