Chef and Girls

CodeChefRating 2417Open on judge ↗

Chef has a problem - he likes a girl but she has 32 secrets and N friends (also girls). Chef has enumerated each girl from 1 to N, Chef's crush has the number 1. Now he consider all girls as nodes of a directed graph. If one girl has an edge directed towards another girl, the former tells all the secrets she knows to the latter. Edges are oriented, so if one girl is sharing secrets with another,

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