Chef and Points
CodeChefOpen on judge ↗
Problem Statement Chef had to select three points out of N given points. But, he has a restriction on selection of the points. He can select only those points in which the farthest distance between any two points does not exceed K. Input First line of input contains T number of test cases. Each test case contains two lines. First line of which contains two integers N number of points and K. Sec
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