Joining Date
$N$ candidates (numbered from $1$ to $N$) join Chef's firm. The first $5$ candidates join on the first day, and then, on every subsequent day, the next $5$ candidates join in. For example, if there are $12$ candidates, candidates numbered $1$ to $5$ will join on day $1$, candidates numbered $6$ to $10$ on day $2$ and the remaining $2$ candidates will join on day $3$. Candidate numbered $K$ deci
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.
Sign in to chat with the tutor and save your progress.
Sign in to start