...

/

The Number of the Smallest Unoccupied Chair

The Number of the Smallest Unoccupied Chair

Try to solve The Number of the Smallest Unoccupied Chair problem.

Statement

At a party, nn friends, numbered from 00 to n1n - 1, arrive and leave at different times. There are infinitely many chairs, numbered 00 onwards. Each arriving friend sits on the smallest available chair at that moment.

For example, if chairs 00, ...