HDU 3711 D - Binary Number

原创 2016年06月01日 22:22:00

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

在A里面找到一个数使得它和B里面的数二进制化时不一样的位数最大,如果有多个答案,取最小值,模拟。

代码:


#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int a[105];  
int count(int a)  
{  
    int ans = 0;  
    for(;a;a>>=1) if(a&1) ans++;  
    printf("ans=%d\n",ans);
    return ans;  
}  
int main()  
{  
    int b, i, j, n, m, k, minn, t,cas;  
    scanf("%d",&cas);  
    while(cas--)  
    {  
        scanf("%d%d",&n,&m);  
        for(i=0; i<n; i++) 
        scanf("%d",&a[i]);  
        for(i=0; i<m; i++)  
        {  
            scanf("%d",&b);  
            minn = count(b^a[0]);  
            k = 0;  
            for(j=1; j<n; j++)  
            {  
                t = count(b^a[j]);  
                if(t<minn||t==minn&&a[j]<a[k])  
                    { minn = t;k = j;}  
            }  
            printf("%d\n",a[k]);  
        }  
    }  
    return 0;  
} 
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU-3711 Binary Number(贪心)

HDU-3711 Binary Number(贪心)

HDU 3711 Binary Number

Binary Number Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) ...

HDU3711 Binary Number

最近一段时间杭电10点就打烊了!题目链接就不上了; 很长一段时间没有更新博客了!最近一段时间会陆陆续续的将近期做过的一些题目分享出来,也是为了勉励自己! Description ...

poj 3711 Binary Number -- 据说是暴力(利用数位计算异或^水过)

Binary Number Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) ...

hdu 5613 /BC 69D Baby Ming and Binary image

开始时漏看了题意 没看到第一行和最后一行是空的 还以为要网络流什么的 后面仔细看了一下 才看懂 白书上有一道类似的做法 枚举第一排的摆放 推出剩余排 注意最后要坚持 最后一行和一列的是否满足输入矩阵...

No. 20 - Number of 1 in a Binary

No. 20 - Number of 1 in a Binary Problem: Please implement a function to get the number of 1s i...

LightOJ-1105 Fi Binary Number(斐波那契数列)

F - Fi Binary Number Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld &...

10位以内二进制数字转十进制计算器(Printing the Decimal Equivalent of a Binary Number)

挺有成就感的一个小程序,二进制转十进制。 代码如下: //JHTP Exercise 4.31: Printing the Decimal Equivalent of a Binary N...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)