Problem

CodeChefRating 908Open on judge ↗

*One less problem without ya \ I got one less problem without ya* Alice and Bob are competing in a challenge. Initially Alice has $N$ problems and Bob has $M$ problems. - Each time Alice solves a problem, Bob receives **one more** problem to solve. - Each time Bob solves a problem, Alice receives **three more** problems to solve. Find whether it is possible that both of them have the **same** n

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.

voice by Sarvam AI