#include <bits/stdc++.h> using namespace std; #define X first #define Y second #define ii pair<int, int> #define ll long long int n, sum; vector<int> v; //Autor: Jakub Wielocha // VI LO Radom int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n; for(int i = 1;i<=1048576;i++) { if(sum<n) v.push_back(i), sum+=(__builtin_popcount(i)); } bool spr = false; for(int i = v.size()-1;i>=0;i--) if(sum-(__builtin_popcount(v[i]))==n) { v[i] = -1; spr = true; break; } if(spr) cout<<v.size()-1<<"\n"; else cout<<v.size()<<"\n"; for(int i = v.size()-1;i>=0;i--) if(v[i]!=-1) cout<<v[i]<<" "; 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 40 41 42 | #include <bits/stdc++.h> using namespace std; #define X first #define Y second #define ii pair<int, int> #define ll long long int n, sum; vector<int> v; //Autor: Jakub Wielocha // VI LO Radom int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n; for(int i = 1;i<=1048576;i++) { if(sum<n) v.push_back(i), sum+=(__builtin_popcount(i)); } bool spr = false; for(int i = v.size()-1;i>=0;i--) if(sum-(__builtin_popcount(v[i]))==n) { v[i] = -1; spr = true; break; } if(spr) cout<<v.size()-1<<"\n"; else cout<<v.size()<<"\n"; for(int i = v.size()-1;i>=0;i--) if(v[i]!=-1) cout<<v[i]<<" "; return 0; } |