Burla To Sambalpur

CodeChefOpen on judge ↗

SRR lives in Burla. He wants to go to Sambalpur. There are two routes to Sambalpur. In the first route, He goes to place A and then A to Sambalpur. In the second route, He goes to place B and then B to Sambalpur. Help him to find the minimum distance he needs to travel to reach Sambalpur from Burla. ### Input - The first line will contain $T$, the number of test cases. - Each test case con

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