Problem Description

(From wikipedia) For binary strings a and b the Hamming distance is equal to the number of ones in a XOR b. For calculating Hamming distance between two strings a and b, they must have equal length.
Now given N different binary strings, please calculate the minimum Hamming distance between every pair of strings.

 

Input

The first line of the input is an integer T, the number of test cases.(0<T<=20) Then T test case followed. The first line of each test case is an integer N (2<=N<=100000), the number of different binary strings. Then N lines followed, each of the next N line is a string consist of five characters. Each character is '0'-'9' or 'A'-'F', it represents the hexadecimal code of the binary string. For example, the hexadecimal code "12345" represents binary string "00010010001101000101".

 

Output

For each test case, output the minimum Hamming distance between every pair of strings.

 

Sample Input

 

Sample Output

 

Source

 

#include<bits/stdc++.h>

using namespace std;

#define ll long long

#define pi (4*atan(1.0))

#define eps 1e-14

const int N=1e5+,M=4e6+,inf=1e9+,mod=1e9+;

const ll INF=1e18+;

int getnum(char a)

{

    if(a>=''&&a<='')

        return a-'';

    return a-'A'+;

}

int check(int x,int y)

{

    int sum=;

    while(x||y)

    {

        if(x%!=y%)

        sum++;

        x>>=;

        y>>=;

    }

    return sum;

}

char ch[N][];

int mp[][];

int main(){

    for(int i=;i<;i++)

    {

        for(int t=;t<;t++)

            mp[i][t]=check(i,t);

    }

    int T;

    scanf("%d",&T);

    while(T--)

    {

        int x;

        scanf("%d",&x);

        for(int i=;i<x;i++)

        scanf("%s",ch[i]);

        int ans=inf;

        for(int i=;i<=;i++)

        {

            int k=;

            int n=rand()%x;

            int m=rand()%x;

            if(n==m)continue;

            for(int t=;t<;t++)

            k+=mp[getnum(ch[n][t])][getnum(ch[m][t])];

            ans=min(ans,k);

        }

        printf("%d\n",ans);

    }

    return ;

}