#include 〈iostream〉 
#include 〈list〉 
#include 〈bitset〉 
using namespace std; 

//遞歸輸出二進(jìn)制函數(shù) 
void BinaryRecursion(int n) 
{ 
 int a; 
 a=n%2; 
 n=n〉〉1; 
 if (n==0) 
 ; 
 else 
 BinaryRecursion(n); 
 cout〈〈a; 
} 


//使用容器轉(zhuǎn)換二進(jìn)制 
void BinaryVector(int n) 
{ 
 int temp; 
 temp=n; 
 list〈int〉 L; 
 while(temp!=0) 
 { 
 L.push_front(temp%2); 
 temp=temp〉〉1; 
 } 
 for (list〈int〉::iterator iter=L.begin();iter!=L.end();iter++ ) 
 cout〈〈*iter; 
 cout〈〈endl; 
} 


//一般方法，32位，逐步與1做與運(yùn)算。 
void Binarycout(int n) 
{ 
 for (int i=31;i〉=0;i--) 
 { 
 cout〈〈((n〉〉i)&1); 
 } 
 cout〈〈endl; 
} 


//使用bitset轉(zhuǎn)換二進(jìn)制 
void BinaryBitset(int n) 
{ 
 cout〈〈bitset〈sizeof(int)*8〉(n)〈〈endl; 
} 

int main() 
{ 
 int a=1045,b=2; 
 int c; 
 c=a+b; 
 cout〈〈"BinaryRecursion(c)："; 
 BinaryRecursion(c); 
 cout〈 BinaryVector(c); 
 cout〈〈"Binarycout(c):"; 
 Binarycout(c); 
 cout〈〈"BinaryBitset(c):"; 
 BinaryBitset(c); 
 cout〈〈"BinaryChar(c):"; 
 BinaryChar(c); 
 //cout〈 return 0; 
} 

BinaryRecursion(c)：10000010111 
BinaryVector(c):10000010111 
Binarycout(c):00000000000000000000010000010111 
BinaryBitset(c):00000000000000000000010000010111 
BinaryChar(c):10000010111 
Press any key to continue