USACO3.2.2--Stringsobits
摘要：
StringsobitsKim SchrijversConsider an ordered set S of strings of N (1 <= N <= 31) bits. Bits, of course, are either 0 or 1.This set of strings is interesting because it is ordered and contains all possible strings of length N that have L (1 <= L <= N) or fewer bits that are `1'.Your 阅读全文
posted @ 2013-02-25 18:36 仗剑奔走天涯 阅读(187) 评论(0) 推荐(0) 编辑
