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 MMM_AAA_NNN
def checkio(n, m):
n = bin(n)[2:]
m = bin(m)[2:]
q = max(len(n), len(m))
n = n.zfill(q)
m = m.zfill(q)
return sum(n[i] != m[i] for i in range(q))
March 31, 2015
