Enough Buses — Solution & Editorial

Back to the Problem

Ceiling division: (N + S − 1) / S in integers.

Complexity: O(1) or O(log)

Watch out: N + S can overflow if both are near the top in 64-bit unsigned mixing — compute carefully or use N/S + (N%S != 0).