Chef and Stations

CodeChefOpen on judge ↗

Chef is stranded at station number $N$ and wants to visit Chefa. Chefa has three stations to get down $A$ , $B$, $C$ and wants to get down at the nearest station from Chef. Help Chefa choose. Input - The first line of the input contains single integer T, denoting the number of test cases. Then T test cases follow. - The only line of each test case contains $4$ space-separated integers $N$ $A$

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.

voice by Sarvam AI