Marriage and Plates
CodeChefOpen on judge ↗
You have gone to a marriage party along with your friends and you want to use all the plates there. You have two plate stacks/piles containing $a$ and $b$ plates. On each move, you can either remove one plate from the left stack and two plates from the right stack, or two plates from the left stack and one plate from the right stack. Your task is to efficiently find out if you can empty
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