Help Lisa

CodeChefOpen on judge ↗

Lisa is an intelligent girl.Ayan, being jealous of Lisa, challenges her with a tricky question.Ayan gives $N$ tasks, of which $'a'$ are of category-1,$'b'$ are of category-2 and $'c'$ are of category-3. Each task can be solved using any of the three appraoches $'X','Y','Z'$. But each approach can be used only for fixed number of times, i.e,Approach-$X$ for $'x'$ times , Approach-$Y$ for $'y'$ tim

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