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 integers 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
题意:给你m个数,和n个数,求出这n个数,每个数的二进制数与这m个数的二进制数相差位数最少的数,存在多个数相差位数相同时取最小的
题解:暴力,二进制运算,疑惑一下剩下的1的个数就是不同位的个数
代码:
#include <bits/stdc++.h>
using namespace std;
int m, n;
int x[110], y[110];
int mini;
int minp;
int main()
{
int T;
cin >> T;
while (T--)
{
cin >> m >> n;
for (int i = 0; i<m; i++)
{
cin >> x[i];
}
for (int i = 0; i<n; i++)
{
cin >> y[i];
}
for (int i = 0; i<n; i++)
{
mini = 0;
minp = 1000;
for (int j = 0; j<m; j++)
{
int p = 0;
int t = y[i] ^ x[j];
while (t>0)
{
if (t & 1)
{
p++;
}
t = t >> 1;
}
if (p < minp)
{
minp = p;
mini = x[j];
}
else if(p == minp)
{
if (x[j] < mini)
mini = x[j];
}
}
cout << mini << endl;
}
}
}
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 integers 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