HDU 3711 Binary Number

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3711

分析：直接暴力

#include <cstdio>
#include <cstring>

const int MAXN = 100 + 10;

struct Set
{
    int num;
    char bi[25];
};

char str[25];
int m, n;
char temp[25];
Set S[MAXN];

void Change( int num )
{
    memset( temp, '0', sizeof( temp ) );

    int a = num;
    int r, k = 24;

    while( a != 0 )
    {
        r = a % 2;
        temp[k--] = r + '0';
        a = a / 2;
    }

  //  puts(temp);
    return;
}

int CountDiff( char *a, char *b )
{
    int cnt = 0;
    for ( int i = 0; i < 25; i++ )
        if ( a[i] != b[i] ) cnt++;
    return cnt;
}

int FindMin()
{
    int ans;
    int min = 0x7fffffff, min_i, min_num;

    for ( int i = 0; i < m; i++ )
    {
        ans = CountDiff( S[i].bi, temp );
        if ( ans < min )
        {
            min = ans;
            min_i = i;
            min_num = S[i].num;
        }
        else if ( ans == min )
        {
            if ( S[i].num < min_num )
            {
                min = ans;
                min_i = i;
                min_num = S[i].num;
            }
        }
    }

    return min_i;
}

int main()
{
    int T;
    scanf( "%d", &T );
    while ( T-- )
    {
        scanf( "%d%d", &m, &n );
        for ( int i = 0; i < m; i++ )
        {
            scanf("%d", &S[i].num);
            Change( S[i].num );
            strcpy( S[i].bi, temp );
        }
        int a;
        for ( int j = 0; j < n; j++ )
        {
            scanf( "%d", &a );
            Change( a );
            printf( "%d\n", S[FindMin()].num );
        }
    }
    return 0;
}