Hamming Distance of Two bit-strings
The hamming distance between two bit-strings is the number of positions those bit-strings are different. Given two bit-strings you are asked to calculate the hamming distance between those two.
The input contains two lines each one representing one of the two bit-strings. Both of the bit-strings are guaranteed to have the same length (1 ≤ |s1| = |s2| ≤ ).
The program should print the hamming distance between those bit-strings.
110111differ in positions (1-based) 2 and 5.
s1 ≠ s2and
s1 ≠ s2
Time limit: 2 seconds
Memory limit: 512 MB
Output limit: 1 MB