Shoppers
CodeChefOpen on judge ↗
A group of N shoppers go to a supermarket. The supermarket has M items. Each shopper wants to buy only the items he likes. They plan to buy K items in all. A shopper can buy at max only one item. Some shoppers may not buy anything and some items might not be bought. Input First line contains the number of test cases. Each test case contains three integers N , M and K separated by spaces. Then f
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