Devu and Nicky

CodeChefOpen on judge ↗

Today is the Swayamvar of Nicky, the daughter of Chef. To win the swayamvar participants needs to solve the Problem of DIV. Problem of Div is described as follows: Initially the participants will be given N names (length of name be LEN) and K sets of names. Now lets say we can write N names in a set S = {name1, name2, ..., nameN}, also this set can be written in the form as R = {R1, R2,...,Rj} s

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