The Selection

SUST has n departments numbered from 1 to n where every pair of distinct departments is connected by…

Click here to read the complete problem statement.

If you need help solving this problem, mention your approach and ask specific questions. Please avoid sharing your code and asking the Community to figure out “what’s wrong”.