I - Secrets

CodeChefOpen on judge ↗

There are **n** people who call themselves *friends*. However, you can't trust people blindly these days! Not each of these people trusts all the other people. The good thing is, still there are some pairs of people who trust each other and consider each other as *true friends*. Also, each person has a *best friend*. Note that a *best friend* is also a *true friend*. These relations are symmetric

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