欢迎来到天天文库
浏览记录
ID:53872718
大小:16.50 KB
页数:3页
时间:2020-04-10
《二进制转十进制.doc》由会员上传分享,免费在线阅读,更多相关内容在行业资料-天天文库。
1、一些关于二进制转换十进制的代码,在网上看到的,总结了一下,第一个是我自己写的,其他的是别人的.其中有一些很经典,有一些很复杂,但是效率很高,有一些我看不懂的.1.#includeusingnamespacestd;classBinarySystem{public:BinarySystem(intnumber);intbCout();private:intrNum;};BinarySystem::BinarySystem(intnumber){rNum=0;intresult(number),residue(
2、0);while(result!=1){result=result/2;residue=result%2;if(residue==1)++rNum;}}intBinarySystem::bCout(){rNum+=1;returnrNum;}intmain(){cout<<"Pleaseinsertanumber"<>a;BinarySystembinary(a);b=binary.bCout();cout<<"Thenumberis"<3、intbit_count(unsignedintn){intcount;for(count=0;n;n&=n-1)count++;returncount;}voidmain(){unsignedintn;intcnt;cout<<"Inputyournum:"<>n;cnt=bit_count(n);cout<<"countnumofbits:"<4、+1))#defineROUND(n,c)(((n)&MASK(c))+((n)>>POW(c)&MASK(c)))intcount(intn){n=ROUND(n,0);n=ROUND(n,1);n=ROUND(n,2);n=ROUND(n,3);n=ROUND(n,4);returnn;}4.#include//Hacker'sDelight,5-1//Figure5-2Counting1-bitsinaword.intpop(unsignedx){x=x-((x>>1)&0x55555555);x=(x5、&0x33333333)+((x>>2)&0x33333333);x=(x+(x>>4))&0x0F0F0F0F;x=x+(x>>8);x=x+(x>>16);returnx&0x0000003F;}intmain(){unsignedlongx;while(1){printf("inputaninteger:");scanf("%d",&x);if(x==0)break;printf("0x%08X:Numberof1-bits:%d",x,pop(x));}return0;}5.根据十一楼的想法编写的:一个奇数/2后的6、二进制数1个数+1就得到原来的二进制数intbit_count(inta){intb=0;while(a){if(a%2)b++;a=a/2;}returnb;}
3、intbit_count(unsignedintn){intcount;for(count=0;n;n&=n-1)count++;returncount;}voidmain(){unsignedintn;intcnt;cout<<"Inputyournum:"<>n;cnt=bit_count(n);cout<<"countnumofbits:"<4、+1))#defineROUND(n,c)(((n)&MASK(c))+((n)>>POW(c)&MASK(c)))intcount(intn){n=ROUND(n,0);n=ROUND(n,1);n=ROUND(n,2);n=ROUND(n,3);n=ROUND(n,4);returnn;}4.#include//Hacker'sDelight,5-1//Figure5-2Counting1-bitsinaword.intpop(unsignedx){x=x-((x>>1)&0x55555555);x=(x5、&0x33333333)+((x>>2)&0x33333333);x=(x+(x>>4))&0x0F0F0F0F;x=x+(x>>8);x=x+(x>>16);returnx&0x0000003F;}intmain(){unsignedlongx;while(1){printf("inputaninteger:");scanf("%d",&x);if(x==0)break;printf("0x%08X:Numberof1-bits:%d",x,pop(x));}return0;}5.根据十一楼的想法编写的:一个奇数/2后的6、二进制数1个数+1就得到原来的二进制数intbit_count(inta){intb=0;while(a){if(a%2)b++;a=a/2;}returnb;}
4、+1))#defineROUND(n,c)(((n)&MASK(c))+((n)>>POW(c)&MASK(c)))intcount(intn){n=ROUND(n,0);n=ROUND(n,1);n=ROUND(n,2);n=ROUND(n,3);n=ROUND(n,4);returnn;}4.#include//Hacker'sDelight,5-1//Figure5-2Counting1-bitsinaword.intpop(unsignedx){x=x-((x>>1)&0x55555555);x=(x
5、&0x33333333)+((x>>2)&0x33333333);x=(x+(x>>4))&0x0F0F0F0F;x=x+(x>>8);x=x+(x>>16);returnx&0x0000003F;}intmain(){unsignedlongx;while(1){printf("inputaninteger:");scanf("%d",&x);if(x==0)break;printf("0x%08X:Numberof1-bits:%d",x,pop(x));}return0;}5.根据十一楼的想法编写的:一个奇数/2后的
6、二进制数1个数+1就得到原来的二进制数intbit_count(inta){intb=0;while(a){if(a%2)b++;a=a/2;}returnb;}
此文档下载收益归作者所有