fjnu 1727 进制转换

-13

-1101

KEY：用栈结构（虽然我没用，呵呵），简单题，easy to AC

Source:#include<iostream>


using namespace std;




void fun(int x)




...{


int a[100000];


int n=0;


if(x<0)




...{


cout<<"-";


x=-x;


}


int i=1;


while(x!=0)




...{


a[i++]=x%2;


x=x/2;


n++;


}


for(i=n;i>0;i--)




...{


cout<<a[i];


}


}




int  main()




...{


int x;


cin>>x;


if(x==0)




...{


cout<<"0";


exit(1);


}


fun(x);


}