摘要:
取自Programming Pearls#define BITSPERWORD 32#define SHIFT 5#define MASK 0x1F#define N 1000000int a[1+N/BITSPERWORD];void set(int i){a[i>>SHIFT]|=1<<(i&MASK);}void clr(int i){a[i>>SHIFT]&=~(1<<(i&MASK));}int test(int i){return a[i>>SHIFT]&(1<<(i&M 阅读全文
posted @ 2012-12-23 22:04
蜗niu漫步
阅读(211)
评论(0)
推荐(0)