LOOK!
4 第1章 游戏之乐——游戏中碰到的题目
unsigned char b;
for(LSET(b, 1); LGET(b) <= GRIDW * GRIDW; LSET(b, (LGET(b) + 1))) for(RSET(b, 1); RGET(b) <= GRIDW * GRIDW; RSET(b, (RGET(b) + 1))) if(LGET(b) % GRIDW != RGET(b) % GRIDW)
printf("A = %d, B = %d\n", LGET(b), RGET(b));
return 0; }


unsigned char a:4; unsigned char b:4; } i;
for(i.a = 1; i.a <= 9; i.a++)
for(i.b = 1; i.b <= 9; i.b++) if(i.a % 3 != i.b % 3)
printf(“A = %d, B = %d\n”, i.a, i.b);
//
// 烙饼排序实现 //
/****************************************************************/ class CPrefixSorting {
public:
CPrefixSorting() {
m_nCakeCnt = 0; m_nMaxSwap = 0; }
~CPrefixSorting() {
if( m_CakeArray != NULL ) {
delete m_CakeArray; }
if( m_SwapArray != NULL ) {
delete m_SwapArray; }
if( m_ReverseCakeArray != NULL ) {
delete m_ReverseCakeArray; }
if( m_ReverseCakeArraySwap != NULL ) {
delete m_ReverseCakeArraySwap;
热门文档