Hamming distance between integers
Let’s define the hamming distance between two integers as the hamming distance between their binary representations. In case the lengths of those representations are different, the shorter one should be filled with 0s.
Given two integers
a and b, you are asked to calculate the hamming distance between those two.Input
The input contains two integers
a and b (1 ≤ a, b ≤ ).Output
The program should print the hamming distance between
a and b.Examples
Input | Output |
3 9 | 2 |
Explanation
3: 0011, 9: 1001 ⇒ hamming distance = 2
Constraints
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB