#include<bits/stdc++.h>
using namespace std;
int bits(int n) {
int w = 0;
for(int i=0; i<sizeof(int)*8; i++) {
if(n & (1 << i)) w++;
}
return w;
}
const int roz = 213769;
bool isTaken[roz];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, length=0, bitCount=0, i=1;
cin >> n;
while(bitCount < n) {
length++;
isTaken[i] = true;
bitCount += bits(i++);
}
while(bitCount != n) {
if(bits(--i) <= bitCount - n) {
isTaken[i] = false;
length--;
bitCount -= bits(i);
}
}
cout << length << "\n";
for(i=roz-1; i>0; i--) {
if(isTaken[i]) cout << 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 43 44 45 | #include<bits/stdc++.h> using namespace std; int bits(int n) { int w = 0; for(int i=0; i<sizeof(int)*8; i++) { if(n & (1 << i)) w++; } return w; } const int roz = 213769; bool isTaken[roz]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, length=0, bitCount=0, i=1; cin >> n; while(bitCount < n) { length++; isTaken[i] = true; bitCount += bits(i++); } while(bitCount != n) { if(bits(--i) <= bitCount - n) { isTaken[i] = false; length--; bitCount -= bits(i); } } cout << length << "\n"; for(i=roz-1; i>0; i--) { if(isTaken[i]) cout << i << ' '; } return 0; } |
English