← All problemsSign in

It happens every year

“Chotu and BornConfused are friends.” “Live for each other,die for each other.” There are $N$ restaurant in a city .Each restaurant is connected to every other by a pair of directed road. Like every year it’s time coming when BornConfused will meet his new crush. She do not like cheap restaurants.Out of $N$ restaurants at least one is not cheap. Chotu knows everything. He knows that which resta

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

Sign in to chat with the tutor and save your progress.

Sign in to start