[Solution] Circular Track CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Circular Track CodeChef Solution | CodeChef Problem Solution 2022

There is a circular track of length M$M$ consisting of M$M$ checkpoints and M$M$ bidirectional roads such that each road has a length of 1$1$ unit.

Chef is currently at checkpoint A$A$ and wants to reach checkpoint B$B$. Find the minimum length of the road he needs to travel.

Solution Click Below:-  CLICK HERE

Input Format

• First line will contain T$T$, the number of test cases. Then the test cases follow.
• Each test case contains a single line of input, three integers A,B,$A,B,$ and M$M$ - the initial checkpoint, the final checkpoint, and the total number of checkpoints respectively.

Get Subscription CodeChef Solution

Chef gives Party CodeChef Solution

Dominant Army CodeChef Solution

Circular Track CodeChef Solution

Good Pairs CodeChef Solution

Anti-knapsack CodeChef Solution

A Bit Easy CodeChef Solution

Average Gift CodeChef Solution

Output Format

For each test case, output the minimum length Chef needs to travel.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 2≤M≤109$2\le M\le {10}^9$
• 1≤A,B≤M$1\le A,B\le M$
• A≠B$A\ne B$

Join Now for Solution:-