영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
The Hamming distance between two strings a and b of equal length is the number of positions where the strings differ.
You are given n bit strings, each of length k and your task is to calculate the minimum Hamming distance between two strings.
Input
The first input line has two integers n and k: the number of bit strings and their length.
Then there are n lines each consisting of one bit string of length k.
Output
Print the minimum Hamming distance between two strings.
Constraints
- 2 ≤ n ≤ 2 · 10^4
- 1 ≤ k ≤ 30
Example
Explanation: The strings 101000 and 001000 differ only at the first position.
예제
예제 1
5 6 110111 001000 100001 101000 101110
1