#include
#define ORDER 2010
/**
* 判斷指定的正整數(shù)是否為好數(shù)(二進制表示時有偶數(shù)位 1)
* @param dwSample 指定的正整數(shù)
* @return 指定的正整數(shù)是好數(shù)則返回非零,否則返回零
*/
int isGood(unsigned long dwSample) {
int iCount;
if (dwSample == 0) {
return 0;
}
/* 依次將每一位移動到最低位 */
for (iCount = 0; dwSample != 0; dwSample >>= 1) {
/* 最低位為 1 則計數(shù) */
if (dwSample & 1) {
++iCount;
}
}
return (iCount % 2) == 0;
}
void main() {
unsigned long dw;
int iCount;
/* 在雙字節(jié)正整數(shù)范圍內(nèi)尋找 */
for (iCount = 0,dw = 1; dw != 0; ++dw) {
if (isGood(dw)) {
++iCount;
if (iCount == ORDER) {
printf("Found:%d !\n",dw);
return;
}
}
}
printf("Failed!\n");
}