题解 | #二进制数#
二进制数
https://www.nowcoder.com/practice/103dd589fed14457a673c613d8de3841
#include<iostream>
using namespace std;
int main(){
long long n;
while(scanf("%d",&n)!=EOF){
int res[10000]; //存放二进制数
int count=0;
while(n!=0){
res[count++]=n%2;
n/=2;
}
for(int i=count-1;i>=0;i--){ //从高位到低位输出
cout<<res[i];
}
cout<<endl;
}
return 0;
}
