Chefs Game
CodeChefOpen on judge ↗
Chef is playing a game where he has $N$ points on the straight line - positions of the sugar cubes and $M$ points on the same line - positions of ants. All ants work the same way, an ant can sense sugar cube within range of $R$ .Your task is to find $minimal$ $R$ such that every cube is sensed by either of the ant, i.e. for each sugar cube there is at least one ant at the distance which is not mor
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