Notorious Kids
CodeChefOpen on judge ↗
There is a class of $N$ Kids. These Kids are very notorious in nature , so class teacher wants to make them sit as far as possible from each other. There are $R$ Empty Benches in the class. This Bench numbers will be given in an array. Class teacher wants to assign the kids to the empty benches, such that the minimum distance between any two of them is as large as possible. What is the largest mi
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