ACM3-1015

Problem O

Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 98   Accepted Submission(s) : 74

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
  
  

 

#include <iostream>
using namespace std;
int main()
{
    int a[12];int base10;
    while(cin>>base10)
    {
        int dig=0;
        while (base10>0)
        {
              a[dig++]=base10&1;
              base10>>=1;
        }
        for (dig--;dig>=0;dig--){cout<<a[dig];}
        cout<<endl;
    }
    return 0;
}