【杭电100题】校庆杯Warm Up 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.

#include <iostream>

using namespace std;

int main()
{
    int n,i;
    int s[10];    //n最大为1000
    while(cin>>n){
        for(i=0;n!=0;i++,n/=2)
            s[i]=n%2;
        for(i--;i>=0;i--)
            cout<<s[i];
        cout<<endl;
    }
    return 0;
}