Number of Bit Flips Problem Statement

Ninja is practicing binary representations and stumbled upon an interesting problem. Given two numbers 'A' and 'B', you are required to determine how many bits need to be flipped in 'B' to convert it to 'A'.

Help Ninja by finding the number of bit flips required.

Input:

T  // an integer representing the number of test cases.
For each test case, two integers A and B are provided.

Output:

Output the number of bit flips required for each test case on a new line.

Example:

Input:

A = 13, B = 7

Output:

2

Explanation:

The binary representation of A is 1101 and B is 0111. Two bits differ between these numbers, hence the number of flips needed is 2.

Constraints:

• 1 <= T <= 10
• 1 <= A, B <= 10^9
• Time limit: 1 sec