摘要：
炮姐v587:http://misakamm.com/blog/25有一个排列,我们可以轻易得到下一个排列:http://www.cnblogs.com/threef/p/3200507.html怎么枚举下一个组合呢:科普:x - 1 : 100 后缀反转m100 -> m011x&(x - 1)消除最后一个有效位x^(x - 1):100后缀掩码x + 1: 011 后缀反转m011 -> m100x&(x + 1)消除后缀连续连续有效位x^(x + 1):011后缀掩码-x: 求反加1x& -x: 得到最低有次位掩码(有木有想到树状数组)x + (x&a 阅读全文
摘要：
#include void cls( HANDLE hConsole ){ COORD coordScreen = { 0, 0 }; // home for the cursor DWORD cCharsWritten; CONSOLE_SCREEN_BUFFER_INFO csbi; DWORD dwConSize;// Get the number of character cells in the current buffer. if( !GetConsoleScreenBufferInfo( hConsole, &csbi )) { re... 阅读全文