J1 Dabbawalas Dilemma
CodeChefOpen on judge ↗
The Dabbawalas Dilemma The Dabbawalas in Mumbai have started finding the ever-increasing workload a bit too much lately. Flooded with parcels every morning, they have decided to ask us programmers for some help. They have to transport n number of food parcels in food containers. There are two types of food containers available. - Type 1: Price of the container is p1 and can contain exactly 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.
Sign in to chat with the tutor and save your progress.
Sign in to start