摘要：
Hamming CodesRob Kolstad Given N, B, and D: Find a set of N codewords (1 using namespace std;
const int mm=10) { if(z&1) ans++; z>>=1; } return ans;
}
void dfs(int dep)
{ if(dep==a)return; int i,j; for(i=1;i>a>>b>>c; len=1
#include #include #define MAX (1 << 8 + 1)
#de 阅读全文
