编程之美-1.2、中国象棋

#include “stdafx.h”

#define HALF_BITS_LENGTH 4

#define FULLMASK 255

#define LMASK (FULLMASK<<HALF_BITS_LENGTH)

#define RMASK (FULLMASK>>HALF_BITS_LENGTH)

#define LSET(b,n) (b=((b&RMASK)|(n<<HALF_BITS_LENGTH)))

#define RSET(b,n) (b=((b&LMASK)|n))

#define LGET(b) ((b&LMASK)>>HALF_BITS_LENGTH)

#define RGET(b) (b&RMASK)

#define GRIDW 3

struct

{

unsigned char a:4;

unsigned char b:4;

}i;

int _tmain(int argc, _TCHAR* argv[])

{

//方法一、

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));

}

//方法二、

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);
    return 0;

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);

    return 0;

    原文作者:qeshine
    原文地址: https://blog.csdn.net/qeshine/article/details/8744513
    本文转自网络文章,转载此文章仅为分享知识,如有侵权,请联系博主进行删除。
点赞