[Solution] Divisible by 3 CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Divisible by 3 CodeChef Solution | CodeChef Problem Solution 2022

Stack likes the number 3$3$ a lot.

He has two non-negative integers A$A$ and B$B$.
In one operation, Stack can do either of the following:

• A:=|A−B|$A:=|A-B|$ (change A$A$ to |A−B|$|A-B|$)
• B:=|A−B|$B:=|A-B|$ (change B$B$ to |A−B|$|A-B|$)

Note that |X|$|X|$ denotes absolute value of X$X$. For example |−7|=7$|-7|=7$ and |4|=4$|4|=4$.

Find the minimum number of operations after which at least one integer out of A$A$ 

Solution Click Below:-  CLICK HERE

and B$B$ becomes divisible by 3$3$.

Input Format

• The first line of input contains a single integer T$T$, denoting the number of test cases. The description of T$T$ test cases follows.

Age Limit Codechef Solution

Equal Distribution Codechef Solution

Minimum number of Flips CodeChef Solution

Divisible by 3 CodeChef Solution

How Many Maximums CodeChef Solution

Minimum or Maximum CodeChef Solution 

Maximise Set Bits CodeChef Solution

Sorting Array CodeChef Solution

Construct An Array CodeChef Solution

• The only line of each test case contains two integers A$A$ and B$B$.

Output Format

For each test case, output in a single line the minimum number of operations after which at least one integer out of A$A$ and B$B$ becomes divisible by 3$3$.

Constraints

• 1≤T≤105$1\le T\le {10}^5$
• 0≤A,B≤109