Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for The Hamming Distance by arek.kowalski107
def checkio(n, m):
binN = bin(n)[2:]
binM = bin(m)[2:]
if len(binN) > len(binM):
binM = binM.zfill(len(binN))
else:
binN = binN.zfill(len(binM))
counter = 0
for i in range(len(binN)):
if binN[i] != binM[i]:
counter += 1
return counter
Dec. 14, 2016