#include <stdio.h> #include <time.h> #include <math.h> #include <stdlib.h> #include <string.h> #include <map> #include <string> #include <vector> #include <iostream> #include <sstream> #include <queue> #include <algorithm> #include <assert.h> using namespace std; #define ll long long #define PB push_back #define FOR(a,start,end) for(int a=int(start); a<int(end); a++) #define INF INT_MAX #define SORT(a) sort(a.begin(),a.end()) #define CL(a,x) memset(a,x,sizeof(a)) #define REP(a,x) for(int a=0;a<x;a++) #define REP1(a,x) for(int a=1;a<=x;a++) #define MP make_pair typedef vector<ll> vi; typedef pair<ll, ll> pii; typedef vector<string> vs; typedef vector<pii> vii; typedef vector<vector<ll> > vvi; typedef vector<vector<string> > vvs; typedef vector<pair<string, string> > vss; typedef pair<string, string> pss; typedef pair<ll, pii> ppii; typedef vector<ppii> vppii; typedef vector<vector<pii> > vvii; typedef vector<vvi> vvvi; ll n, k, q, d, r, g, b, z, p, a, c; char zn; string wa; vi vk, va; vvi vvk, vva; ll ilb(ll a) { ll z = 0; while (a > 0) { z += a % 2; a /= 2; } return z; } int main() { //freopen("c:\\wojtek\\uva\\pa\\debug\\1.in", "rt", stdin); //d = 1000000007; //while (1) { cin >> n ; vk.clear(); k = 1; while (n > 0) { a = ilb(k); if (a <= n) { vk.push_back(k++); n -= a; } else { vk.push_back(k); a -= n; int i = vk.size() - 2; while ((i >= 0) && (a > 0)) { b = ilb(vk[i]); if (b <= a) { a -= b; vk.erase(vk.begin() + i); } i--; } n = 0; } } cout << (int)vk.size() << endl; for (int i = (int)vk.size() - 1; i >= 0; i--) { cout << vk[i] << " "; } cout << endl; // } 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 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 | #include <stdio.h> #include <time.h> #include <math.h> #include <stdlib.h> #include <string.h> #include <map> #include <string> #include <vector> #include <iostream> #include <sstream> #include <queue> #include <algorithm> #include <assert.h> using namespace std; #define ll long long #define PB push_back #define FOR(a,start,end) for(int a=int(start); a<int(end); a++) #define INF INT_MAX #define SORT(a) sort(a.begin(),a.end()) #define CL(a,x) memset(a,x,sizeof(a)) #define REP(a,x) for(int a=0;a<x;a++) #define REP1(a,x) for(int a=1;a<=x;a++) #define MP make_pair typedef vector<ll> vi; typedef pair<ll, ll> pii; typedef vector<string> vs; typedef vector<pii> vii; typedef vector<vector<ll> > vvi; typedef vector<vector<string> > vvs; typedef vector<pair<string, string> > vss; typedef pair<string, string> pss; typedef pair<ll, pii> ppii; typedef vector<ppii> vppii; typedef vector<vector<pii> > vvii; typedef vector<vvi> vvvi; ll n, k, q, d, r, g, b, z, p, a, c; char zn; string wa; vi vk, va; vvi vvk, vva; ll ilb(ll a) { ll z = 0; while (a > 0) { z += a % 2; a /= 2; } return z; } int main() { //freopen("c:\\wojtek\\uva\\pa\\debug\\1.in", "rt", stdin); //d = 1000000007; //while (1) { cin >> n ; vk.clear(); k = 1; while (n > 0) { a = ilb(k); if (a <= n) { vk.push_back(k++); n -= a; } else { vk.push_back(k); a -= n; int i = vk.size() - 2; while ((i >= 0) && (a > 0)) { b = ilb(vk[i]); if (b <= a) { a -= b; vk.erase(vk.begin() + i); } i--; } n = 0; } } cout << (int)vk.size() << endl; for (int i = (int)vk.size() - 1; i >= 0; i--) { cout << vk[i] << " "; } cout << endl; // } return 0; } |