Tree Boundary
CodeChefOpen on judge ↗
Problem Statement Himesh is a student of NIT Jalandhar. There is a garden in NITJ which has a fountain in the centre of it. There are four paths from the fountain: east path, west path, north path, south path. There are n trees located in the garden, for each of them there are two arguments are: First argument shows the distance on the east-west path from fountain. If it is negative then the di
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