Minimum Hamming Distance
nbit-strings, you are asked to find the pair of bit-strings that has the minimum hamming distance.
The first line of the input contains a single integer
n(2 ≤ n ≤ 1000).
nlines contain bit-strings of the same length each on a separate line (1 ≤ || ≤ ).
The program should print the minimum hamming distance of those pairs.
4 1111 1010 0000 1011
The hamming distance between
Time limit: 3 seconds
Memory limit: 512 MB
Output limit: 1 MB