The Hamming Distance

The Hamming distance between two binary integers is the number of bit positions that differs (read more about the Hamming distance on Wikipedia). For example:

117 = 0 1 1 1 0 1 0 1 17 = 0 0 0 1 0 0 0 1 H = 0+1+1+0+0+1+0+0 = 3

You...

Two arguments as integers.

The Hamming distance as an integer.

checkio(117, 17) == 3 checkio(1, 2) == 2 checkio(16, 15) == 5

This is a basis for Hamming code and other linear error-correcting programs. The Hamming distance is used in systematics as a measure of genetic distance. On a grid (ie: a chessboard,) the Hamming distance is the minimum number of moves it would take a rook to move from one cell to the other.

0 < n < 10

0 < m < 10

You should be an authorized user in order to see the full description and start solving this mission.