You are given two jugs with capacities of x liters and y liters, respectively, along with an infinite water supply. Determine whether it is possible for the total amount of water in both jugs may reach target liters.
You may perform the following operations any number of times:
Fill either jug completely with water.
Empty either jug completely.
Pour water from one jug into the other until either the receiving jug becomes full or the transferring jug becomes empty.
Return TRUE if the total water in both jugs can reach exactly target liters, and FALSE otherwise.
Constraints:
x, y, target
You are given two jugs with capacities of x liters and y liters, respectively, along with an infinite water supply. Determine whether it is possible for the total amount of water in both jugs may reach target liters.
You may perform the following operations any number of times:
Fill either jug completely with water.
Empty either jug completely.
Pour water from one jug into the other until either the receiving jug becomes full or the transferring jug becomes empty.
Return TRUE if the total water in both jugs can reach exactly target liters, and FALSE otherwise.
Constraints:
x, y, target