[Solution] Expected move CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Expected move CodeChef Solution | CodeChef Problem Solution 2022

You are given a fair coin and two integers X$X$ and N$N$.

You repeatedly flip the coin and perform the following operation based on the result:

• If it lands on heads, then X$X$ will increase by 1$1$. However, if X=N$X=N$ then X$X$ will not change.
• If it lands on tails, X$X$ will decrease by 1$1$.

You stop as soon as the value of X$X$ becomes 1$1$.

Find the expected number of coin flips.

Note that it is guaranteed that under the given constraints, the answer is an integer and does not

Solution Click Below:-  CLICK HERE

Input Format

• The first line contains a single integer T$T$ — the number of test cases. Then the test cases follow.

Expected move CodeChef Solution

Chairs Requirement CodeChef Solution

Subscriptions CodeChef Solution

Alternate Additions CodeChef Solution

Equal Strings CodeChef Solution

Divisible by i CodeChef Solution

Possible GCD CodeChef Solution

Reduce to zero CodeChef Solution

Full Path Eraser CodeChef Solution

• The first and only line of each test case contains two space separated integers X$X$ and N$N$.

Output Format

For each testcase, output the expected number of coin flips.

Constraints

• 1≤T≤105$1\le T\le {10}^5$
• 1≤X≤N≤1