枚举->HDU 3711 Binary Number

最新推荐文章于 2021-02-10 11:42:51 发布

Fate_O

最新推荐文章于 2021-02-10 11:42:51 发布

阅读量742

点赞数

分类专栏： ACM->枚举

本文链接：https://blog.csdn.net/u011676717/article/details/12685575

版权

ACM->枚举专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Binary Number

Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status Practice HDU 3711

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

Sample Output

     
     
      
      1
2
1
1
1
9999
0
     
     
     
     

     
     
     
     

     
     
     
     
      
      #include <iostream>
#include <bitset>

using namespace std;

#define MAXN 100 + 10
#define INF 999999999

int temp[MAXN];

void input()
{
    bitset <32> a, b;

    int t, n, m;

    cin >> t;

    while (t--)
    {
        cin >> m >> n;

        for (int i = 0; i < m; i++)
        {
            cin >> temp[i];
        }

        for (int i = 0; i < n; i++)
        {
            int x;

            cin >> x;
            a = x;
            int ans = 0;
            int mi = INF;

            for (int j = 0; j < m; j++)
            {
                b = temp[j];

                int num = 0;

                for (int k = 0; k < 32; k++)
                {
                    if (a[k] != b[k])
                    {
                        num++;
                    }
                }

                if (num < mi)
                {
                    mi = num;
                    ans = temp[j];
                }
                else if (num == mi)
                {
                    ans = min(ans, temp[j]);
                }
            }

            cout << ans << endl;
        }
    }
}

int main()
{
    input();
    return 0;
}