2012年8月6日
usaco2.1.5（hamming）
摘要： 题目：Hamming CodesRob KolstadGiven N, B, and D: Find a set of N codewords (1 <= N <= 64), each of length B bits (1 <= B <= 8), such that each of the codewords is at least Hamming distance of D (1 <= D <= 7) away from each of the other codewords. The Hamming distance between a pair of 阅读全文
posted @ 2012-08-06 11:10 萧若离 阅读(168) 评论(0) 推荐(0)