HDOJ--2051

Bitset
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 17565    Accepted Submission(s): 13147



 
 

  
  Problem Description
 
 
 
 

  
  Give you a number on base ten,you should output it on base two.(0 < n < 1000)
 
 
 
 

  
   
 
 

 
 

  
  Input
 
 
 
 

  
  For each case there is a postive number n on base ten, end of file.
 
 
 
 

  
   
 
 

 
 

  
  Output
 
 
 
 

  
  For each case output a number on base two.
 
 
 
 

  
   
 
 

 
 

  
  Sample Input
 
 
 
 

  
  
   
   

    
    1
2
3
   
   
 
 
 
 

  
   
 
 

 
 

  
  Sample Output
 
 
 
 

  
  
   
   

    
    1
10
11
   
   
 
 
 
 

  
   
 
 
 
 

  
  

 
 
十进制转为二进制：以下是我的AC代码：

#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
const int MAXN=1010;
using namespace std;
double a[MAXN];
int main()
{
    
    int num;
    while(scanf("%d",&num)==1)
    {   int i=0;
        while(num!=0)
        {
            a[i++]=num%2;
            num/=2;
        }
        for(int j=i-1;j>=0;j--)
        cout<<a[j];
        cout<<endl;
    }
    return 0; 
}