//Jakub Trela
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
// -----------------------------------------------------------------------------------
int n;
cin>>n;
int res=0;
stack<int> s1;
queue<int> s2;
int i=1;
while(res<n){
s1.push(i);
res+=__builtin_popcount(i);
i++;
}
while(!s1.empty()){
if(res-__builtin_popcount(s1.top())<n){
s2.push(s1.top());
}else res-=__builtin_popcount(s1.top());
s1.pop();
}
cout<<s2.size()<<endl;
while(!s2.empty()){
cout<<s2.front()<<" ";
s2.pop();
}
// -----------------------------------------------------------------------------------
return 0;
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 | //Jakub Trela #include <bits/stdc++.h> using namespace std; typedef long long LL; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); // ----------------------------------------------------------------------------------- int n; cin>>n; int res=0; stack<int> s1; queue<int> s2; int i=1; while(res<n){ s1.push(i); res+=__builtin_popcount(i); i++; } while(!s1.empty()){ if(res-__builtin_popcount(s1.top())<n){ s2.push(s1.top()); }else res-=__builtin_popcount(s1.top()); s1.pop(); } cout<<s2.size()<<endl; while(!s2.empty()){ cout<<s2.front()<<" "; s2.pop(); } // ----------------------------------------------------------------------------------- return 0; } |
English