Robbery Plan
CodeChefOpen on judge ↗
A thief went for robbery with two bags having capacity of $X$ and $Y$ units respectively.He reaches in a room that contains two types of precious items, one among them are gold coins and other are diamonds.In the room, there are total of $A$ gold coins and $B$ diamond. Each of the gold coins and diamonds weights $N$ and $M$ units respectively. He can put these precious items in his two bags in
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start