Akka friend

CodeChefOpen on judge ↗

Alice is new in college and want to make new friends. He only be friends with short and intelligent people. There are N student(numbered 1 to N) and M information of form (u,v) denoting student u is shorter than v. find the set of all possible student in sorted order who could be Alice's friend. It is guaranteed that information are consistent. ###Input: - First line contains 2 integers $N$ and

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