题解

小趴菜*1
#include <cstddef>
#include <iostream>
#include <cstring>
using namespace std;
long long n, a[1005] = {1}, m = 0;
void f(int n){
if (n <= 0) a[m ++] = 0;
else {
a[m ++] = n % 2;
n /= 2;
f(n);
}
return ;
}
int main(){
memset(a, 10, sizeof a);
cin >> n;
f(n);
for (int i = m - 2; i >= 0; i --){
cout << a[i];
}
return 0;
}