//dzien2 - C
#include <bits/stdc++.h>
using namespace std;
int tab[1000005];
bool check[1000005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
int cnt = 0;
int result = 0;
int i = 0;
while(cnt < n)
{
i++;
cnt += __builtin_popcount(i);
tab[i] = cnt;
//cout<<"1";
}
result = i;
for(int j=i; j>=1; j--)
{
int x = __builtin_popcount(j);
if(cnt - x < n) continue;
if(cnt - x >= n) {check[j] = true; cnt -= x; result--; continue;}
if(cnt == n) break;
//cout<<"2";
}
cout<<result<<"\n";
for(int j=i; j>=1; j--)
{
//cout<<"check "<<j<<" "<<check[j]<<"\n";
if(check[j] == 0) cout<<j<<" ";
//cout<<"3";
}
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 43 44 45 46 47 48 49 50 | //dzien2 - C #include <bits/stdc++.h> using namespace std; int tab[1000005]; bool check[1000005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin>>n; int cnt = 0; int result = 0; int i = 0; while(cnt < n) { i++; cnt += __builtin_popcount(i); tab[i] = cnt; //cout<<"1"; } result = i; for(int j=i; j>=1; j--) { int x = __builtin_popcount(j); if(cnt - x < n) continue; if(cnt - x >= n) {check[j] = true; cnt -= x; result--; continue;} if(cnt == n) break; //cout<<"2"; } cout<<result<<"\n"; for(int j=i; j>=1; j--) { //cout<<"check "<<j<<" "<<check[j]<<"\n"; if(check[j] == 0) cout<<j<<" "; //cout<<"3"; } return 0; } |
English