HDU 4712 Hamming Distance

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

  
  

   
   2
2
12345
54321
4
12345
6789A
BCDEF
0137F
  
  

 

Sample Output

  
  

   
   6
7
  
  

 

Source

2013 ACM/ICPC Asia Regional Online —— Warmup

 

Recommend

liuyiding

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

bitset+随机化~

随机化真是神奇……

输入16进制直接用%x，不用输入字符串然后再算。

每次随机化两个点，然后放在bitset里面计算hamming distance，更新答案即可~

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<climits>
#include<bitset>
using namespace std;
#define inf INT_MAX

int t,n,x,y,a[100000],cnt,ans,num;
bitset<30> c;

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);cnt=1000000;ans=inf;
		for(int i=0;i<n;i++) scanf("%x",&a[i]);
		while(cnt--)
		{
			x=rand()%n;y=rand()%n;
			while(x==y) y=rand()%n;
			c=a[x]^a[y];num=c.count();
			ans=min(ans,num);
		}
		printf("%d\n",ans);
	}
	return 0;
}