1015 problem O

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 n;
    int a[1000];
    while(cin>>n){
        int j=0;
        if(n==0)
            cout<<"0"<<endl;
        while(n!=0){
                a[j]=n%2;
                n=n/2;
                j++;
        }
        for(int i=j-1;i>=0;i--){
            cout<<a[i];
        }
        cout<<endl;
    }
    return 0;
}