十进制转二进制

十进制转二进制

将十进制数转化为二进制并输出（2-31<x<231）

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<ctype.h>
#include<cstring>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<vector>

using namespace std;
typedef long long ll;
const int N=1e5+10;
const int M=1e8;
const ll INF=0x3f3f3f3f;
const int mod=1e9+9;
const double EPS = 1e-9;
const double PI = acos(-1.0);

string s;
int main(int argc,char* argv[]){
    int n;
    while(scanf("%d",&n)!=EOF){
        if(n==0){
            puts("0");
            continue;
        }
        s="";
        for(int i=n;i;i=i/2)
            s=s+(i%2?'1':'0');
        const char* ss=s.c_str();
        reverse(s.begin(),s.end());//转置
        if(n<0)
            cout<<"-"<<ss<<endl;
        else
            cout<<ss<<endl;
    }
    return 0;
}