一个整型数的二进制序列

http://blog.csdn.net/akirya/archive/2007/03/12/1527365.aspx

 

template<int n,int Num> struct Bit { enum { Data = ((Num << ( n - 1 )) & 0x80000000 ) ? '1' : '0' }; }; const int N = -4; char sz[]={ Bit<1 , N>::Data,Bit<2 , N>::Data,Bit<3 , N>::Data,Bit<4 , N>::Data,Bit<5 , N>::Data, Bit<6 , N>::Data,Bit<7 , N>::Data,Bit<8 , N>::Data,Bit<9 , N>::Data,Bit<10, N>::Data, Bit<11, N>::Data,Bit<12, N>::Data,Bit<13, N>::Data,Bit<14, N>::Data,Bit<15, N>::Data, Bit<16, N>::Data,Bit<17, N>::Data,Bit<18, N>::Data,Bit<19, N>::Data,Bit<20, N>::Data, Bit<21, N>::Data,Bit<22, N>::Data,Bit<23, N>::Data,Bit<24, N>::Data,Bit<25, N>::Data, Bit<26, N>::Data,Bit<27, N>::Data,Bit<28, N>::Data,Bit<29, N>::Data,Bit<30, N>::Data, Bit<31, N>::Data,Bit<32, N>::Data , 0 }; int _tmain(int argc, char* argv[]) { printf("%s/n",sz); system("pause"); return 0; }

akirya 同学的这一设计很有意思，很简单，引为欣赏

若都用模板编译期运算来代替运行时的话，那么做ACM的话，谁说C++一定比C慢呢？哈哈……C你怎么着也要些运行时计算的吧，而有C++模板进行编译期运算，运行时只需要输出一个结果就完了……