枚举->HDU 3711 Binary Number

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

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
#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;
}


 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值