[Solution] Possible GCD CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Possible GCD CodeChef Solution | CodeChef Problem Solution 2022

Chef has two distinct positive integers A$A$ and B$B$.

Chef wonders how many distinct values are possible for the expression gcd(A+X,B+X)$\mathrm{g}\mathrm{c}\mathrm{d}(A+X,B+X)$, where X$X$ can take any non-negative integer value.

Help Chef find this value.

Here, gcd$\mathrm{g}\mathrm{c}\mathrm{d}$ stands for Greatest Common Divisor.

Input Format

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

Solution Click Below:-  CLICK HERE

• cases follow.
• The first and only line of each test case contains two distinct space separated integers A$A$ and B$B$.

Output Format

For each testcase, output the number of distinct values of the expression gcd(A+X,B+X)$\mathrm{g}\mathrm{c}\mathrm{d}(A+X,B+X)$,

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

Expected move CodeChef Solution

 where X$X$ can take any non-negative integer value.

Constraints

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