INTERESTING PROBLEM SET!
CodeChefOpen on judge ↗
Vaibhav and Hitik are preparing the problem set for the upcoming round of ZCO. They have a bank of n problems, and they want to select any non-empty subset of it as a problem set. k experienced teams are participating in the contest. Some of these teams already know some of the problems. To make the contest interesting for them, each of the teams should know at most half of the selected problems.
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