#include<iostream>
#include<stack>
using namespace std;
//栈的应用,数制转换
int main()
{
stack<int> mystack;
cout<<"input number:"<<endl;
int a;
int b=0; //用来保存余数
cin>>a;
while(a>0)
{
b=a%2;
mystack.push(b); //入栈
a/=2;
}
while(mystack.size())
{
int m=mystack.top();
mystack.pop();
cout<<m;
}
return 0;
}
11-03
2465