HDU 3711 Binary Number

Binary Number

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2472    Accepted Submission(s): 1444

Problem Description

For 2 non-negative integers x and y, f(x, y) is defined as the number of different bits in the binary format of x and y. For example, f(2, 3)=1,f(0, 3)=2, f(5, 10)=4. Now given 2 sets of non-negative integers A and B, for each integer b in B, you should find an integer a in A such that f(a, b) is minimized. If there are more than one such integer in set A, choose the smallest one.

 

Input

The first line of the input is an integer T (0 < T ≤ 100), indicating the number of test cases. The first line of each test case contains 2 positive integers m and n (0 < m, n ≤ 100), indicating the numbers of integers of the 2 sets A and B, respectively. Then follow (m + n) lines, each of which contains a non-negative integers no larger than 1000000. The first m lines are the integers in set A and the other n lines are the integers in set B.

 

Output

For each test case you should output n lines, each of which contains the result for each query in a single line.

 

Sample Input

  
  

   
   2
2 5
1
2
1
2
3
4
5
5 2
1000000
9999
1423
3421
0
13245
353
  
  

 

Sample Output

  
  

   
   1
2
1
1
1
9999
0
  
  

 

Author

CAO, Peng

 

Source

2010 Asia Chengdu Regional Contest

 

Recommend

zhengfeng

将集合B中的每个数字和集合A中的异或一下 把得到的数字转换成而进制 存到字符数组里 然后数1的个数 有几个1就代表有几个数字不同。

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int f(char s[30])
{
	int k=0;
	for(int i=0;i<30;i++)
	{
		if(s[i]=='1')
		k++;
	}
	return k;
}
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
	int a,b;
	cin>>a>>b;
	int s1[105]={},s2[105]={};
	for(int i=0;i<a;i++)
		cin>>s1[i];
	for(int j=0;j<b;j++)
		cin>>s2[j];

	for(int i=0;i<b;i++)
	{
		int min=30,num=0;

		for(int j=0;j<a;j++)
		{
 			char temp[30]={};
			itoa(s2[i]^s1[j],temp,2);
			if(f(temp)<min)
			{
				min=f(temp);
				num=j;
			}
			else if(f(temp)==min)
			{
				if(s1[j]<s1[num])
				{
					num=j;
				}
			}
		}
		cout<<s1[num]<<endl;
	}
	}
}