HDU_oj_2051 Bitset

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

 

分析：

十进制数转为二进制

类似链接：http://www.cnblogs.com/tenjl-exv/p/8000697.html

注意点：

 

#include<iostream>
using namespace std;

int main()
{
    int n;
    int c[35];
    while(cin>>n)
    {
        int i=1;
        while(n)
        {
            int v=n%2;
            n>>=1;
            c[i++]=v;
        }
    while(--i)
        cout<<c[i];
    cout<<endl;
    }
}