[Solution] Reduce to zero CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Reduce to zero CodeChef Solution | CodeChef Problem Solution 2022

Chef has two integers X$X$ and Y$Y$. Chef wants to perform some operations to make both X$X$ and Y$Y$ zero simultaneously. In one operation, Chef can either:

• set X:=2⋅X$X:=2\cdot X$
• or set Y:=2⋅Y$Y:=2\cdot Y$
• or set X:=X−1$X:=X-1$ and Y:=Y−1$Y:=Y-1$

Chef is a little busy with preparing the contest. Help him find the minimum number of operations required to make both X$X$ and Y$Y$ equal to 0$0$ simultaneously. If it is impossible to do so after any

Solution Click Below:-  CLICK HERE

 number of operations, print −1$-1$.

Input Format

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

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

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

Output Format

For each test case, print the minimum number of operations required to make X$X$ and Y$Y$ zero simultaneously. If it is impossible to do so after any number of operations, print −1$-1$ instead.

Constraints

• 1≤T≤3⋅105$1\le T\le 3\cdot {10}^{}$