usaco Hamming Codes

求出n个在最长b位（二进制）汉明距离为d的数。

题解：

就是简单的枚举一个数，然后判断是否与以找到的数有冲突。因为b最大为8，所以枚举量最大为1<<8 - 1 。

/**
ID: DickensTone
LANG: C++
TASK: hamming
**/
#include<cstdio>
int ans[64 + 5];
int distance(int x, int y)
{
    int m = x^y, cnt = 0;
    for(int i = 0; i < 8; i++)
        if(m & (1<<i)) cnt++;
    return cnt;
}
bool is_hamming(int n, int cnt, int d)
{
    for(int i = 0; i < cnt; i++)
    {
        if(distance(ans[i], n) < d) return false;
    }
    return true;
}
int main()
{
    freopen("hamming.in", "r", stdin);
    freopen("hamming.out", "w", stdout);
    int n, b, d;
    while(scanf("%d%d%d", &n, &b, &d) == 3)
    {
        int cnt = 0;
        ans[cnt++] = 0;
        for(int i = 1; i < (1<<b) && cnt < n; i++)
        {
            if(is_hamming(i, cnt, d))
                ans[cnt++] = i;
        }
        for(int i = 0; i < n; i++)
        {
            printf("%d", ans[i]);
            if(i == n - 1) printf("\n");
            else if((i + 1) % 10 == 0) printf("\n");
            else printf(" ");
        }
    }
    return 0;
}

感觉我的有瑕疵

官方：

#include <stdio.h>
#include <stdlib.h>
#include <iostream.h>
#define MAX (1 << 8 + 1)
#define NMAX 65
#define BMAX 10
#define DMAX 10

int nums[NMAX], dist[MAX][MAX];
int N, B, D, maxval;
FILE *in, *out;

void findgroups(int cur, int start) {
    int a, b, canuse;
    char ch;
    if (cur == N) {
        for (a = 0; a < cur; a++) {
            if (a % 10)
                fprintf(out, " ");
            fprintf(out, "%d", nums[a]);
            if (a % 10 == 9 || a == cur-1)
                fprintf(out, "\n");
        }
        exit(0);
    }
    for (a = start; a < maxval; a++) {
        canuse = 1;
        for (b = 0; b < cur; b++)
            if (dist[nums[b]][a] < D) {
                canuse = 0;
                break;
            }
        if (canuse) {
            nums[cur] = a;
            findgroups(cur+1, a+1);
        }
    }
}

int main() {
    in = fopen("hamming.in", "r");
    out = fopen("hamming.out", "w");
    int a, b, c;
    fscanf(in, "%d%d%d", &N, &B, &D);
    maxval = (1 << B);
    for (a = 0; a < maxval; a++)
        for (b = 0; b < maxval; b++) {
            dist[a][b] = 0;
            for (c = 0; c < B; c++) 
                if (((1 << c) & a) != ((1 << c) & b))
                    dist[a][b]++;
        }
    nums[0] = 0;
    findgroups(1, 1);
    return 0;
}