Forming Teams Again

CodeChefOpen on judge ↗

You are currently in charge of a large multinational company. You have many projects in hand. There are **N** employees currently in your company, all of whom have a unique ID, numbered from **1** to **N**. You want to form a non-empty set of teams of equal sizes from these employees such that each employee works in exactly one team. Your task is to find the number of ways to form such sets of tea

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