Dodgers

CodeChefRating 2643Open on judge ↗

Duck Dodgers is hosting a party to make friends throughout the galaxy. He has already invited $N$ people (numbered $1$ through $N$). Initially, none of them are friends with Duck Dodgers, but he plans to become friends with everyone. Each friendship is between two people and bidirectional. Among these $N$ guests, $M$ friendships have already been made. You are given these $M$ pairs of people who

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