← All problemsSign in

Departments (Easy Version)

CodeChefRating 2400Open on judge ↗

**This is the easy version of the problem. The only difference between the easy and hard versions is that, in the easy one, additionally, there exists a solution with at least $2$ employees in every department.** ChefCorp has $N$ employees. Each employee belongs to **exactly one** of the $M$ departments. Each department is headed by **exactly one** of the employees belonging to that department.

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