Sweet Seller

CodeChefOpen on judge ↗

Chef knows how to prepare two types of sweets S1 and S2. Chef has machines which make N1 amount of S1 and N2 amount of S2 respectively. In order to finish a batch,he needs equal amount of S1 and S2. Let K1 be the minimum amount of sweet required for each type to complete a batch. Also, he needs to order boxes such that he can pack N1 amount of S1 and N2 amount of S2 in same boxes without wasting a

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