Bitset

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

题解：水题一道，简单的shi'十进制转二进制，也没有什么坑；

#include <iostream>
#include <cstring>
using namespace std;

int main()
{
    int n;
    while(cin>>n)
    {
        int a[1000];
        memset(a,0,sizeof(a));
        int i=0;
        while(n>0)
        {
            a[i]=n%2;
            n=n/2;
            i++;
        }
        for(int j=i-1;j>=0;j--)
            cout<<a[j];
        cout<<endl;
    }
    return 0;
}