Algorithms and Data Structures

• Status
• 1
Implementation
• 2
Bitwise operations
• 3
Prefix Sums
• 4
Sliding window / Two pointers
• 5
Modular Arithmetic
• 6
Number Theory
• 7
Binary Search
• 8
Basic Sorting
• 9
Greedy Algorithms
• 10
Basic Dynamic Programming
• 11
Recursion
• 12
• 13
Queue & Stack
• 14
Binary tree + BST
• 15
Divide & Conquer + Advanced Sorting
• 16
Heap
• 17
Hashing
• 18
Graph Representation

• # 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: 1 seconds

Memory limit: 512 MB

Output limit: 1 MB