题解 | #二进制数#
二进制数
https://www.nowcoder.com/practice/103dd589fed14457a673c613d8de3841
#include <cstdio>
#include <stack>
using namespace std;
int main(){
stack <int>stk1;
int n;
while (scanf("%d",&n) !=EOF){
while(n != 0){
stk1.push(n%2);
n=n/2;
}
while(!stk1.empty()){
printf("%d",stk1.top());
stk1.pop();
}
printf("\n");
}
return 0;
}
