Circular Track

CodeChefRating 838Open on judge ↗

There is a circular track of length $M$ consisting of $M$ checkpoints and $M$ **bidirectional** roads such that each road has a length of $1$ unit. ![](https://s3.amazonaws.com/codechef_shared/download/Images/START38/START38.png) Chef is currently at checkpoint $A$ and wants to reach checkpoint $B$. Find the **minimum** length of the road he needs to travel. ### Input - First line will contain

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