Here is a Python solution for the problem:

```python
def countBitsFlip(a,b):
# XOR of two number will have set bits only at those places where a and b have different bits.
# To count the number of set bits in a number, we can use Brian Kernighan’s Algorithm.
n = a^b
count = 0
while n:
n = n & (n-1)
count += 1
return count

T = int(input())
for _ in range(T):
a, b = map(int, input().split())
print(countBitsFlip(a, b))
```

This program works by first taking the XOR of the two numbers, which will have set bits only at those places where a and b have different bits. Then it uses Brian

Question

Here is a Python solution for the problem:

```python
def countBitsFlip(a,b):
    # XOR of two number will have set bits only at those places where a and b have different bits.
    # To count the number of set bits in a number, we can use Brian Kernighan’s Algorithm.
    n = a^b
    count = 0
    while n:
        n = n & (n-1)
        count += 1
    return count

T = int(input())
for _ in range(T):
    a, b = map(int, input().split())
    print(countBitsFlip(a, b))
```

This program works by first taking the XOR of the two numbers, which will have set bits only at those places where a and b have different bits. Then it uses Brian

Knowee AI · Accepted Answer

Here is a Python solution for the problem:

```python
def countBitsFlip(a,b):
    # XOR of two number will have set bits only at those places where a and b have different bits.
    # To count the number of set bits in a number, we can use Brian Kernighan’s Algorithm.
    n = a^b
    count = 0
    while n:
        n = n & (n-1)
        count += 1
    return count

T = int(input())
for _ in range(T):
    a, b = map(int, input().split())
    print(countBitsFlip(a, b))
```

This program works by first taking the XOR of the two numbers, which will have set bits only at those places where a and b have different bits. Then it uses Brian

Question

Solution

Similar Questions

Upgrade your grade with Knowee