#include <bits/stdc++.h> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) #define EACH(it, cont) for (auto &it : cont) #define FOR(i, b, e) for (int i = (b); i <= (e); ++i) #define FORD(i, b, e) for (int i = (b); i >= (e); --i) #define ALL(c) begin(c), end(c) #define dump fancy_dumper::DumpFirst<&std::cerr>(), #define say fancy_dumper::DumpFirst<&std::cout>(), #define $dump fancy_dumper::Dumper<&std::cerr> #define $say fancy_dumper::Dumper<&std::cout> #define $(x) #x, fancy_dumper::ToggleSeparator(), (x),\ fancy_dumper::ToggleSeparator() namespace fancy_dumper { struct ToggleSeparator { }; template<std::ostream *Out> struct DumpFirst { }; template<std::ostream *Out> struct Dumper { static void *&last() { static void *p; return p; } static const char *&separator() { static const char *s = " "; return s; } static const char *&separatorNewLine() { static const char *s = "\n"; return s; } static const char *&unseparator() { static const char *s = "="; return s; } Dumper() { last() = this; } ~Dumper() { if (this == last()) { *Out << separatorNewLine(); last() = 0; } } Dumper operator, (ToggleSeparator) { std::swap(separator(), unseparator()); return Dumper(); } }; template<std::ostream *Out, class T> Dumper<Out> operator,(Dumper<Out>, const T &e) { *Out << Dumper<Out>::separator() << e; return Dumper<Out>(); } template<std::ostream *Out, class T> Dumper<Out> operator, (DumpFirst<Out>, const T &e) { *Out << e; return Dumper<Out>(); } } template<class T, class Y> std::ostream &operator<< (std::ostream &o, const std::pair<T, Y> &p) { return o << p.first << ' ' << p.second; } template<class T> std::ostream &operator<< (std::ostream &o, const std::deque<T> &v) { bool isBegin = true; EACH (e, v) { if (!isBegin) { o << ' '; } isBegin = false; o << e; } return o; } template<class T> std::ostream &operator<< (std::ostream &o, const std::set<T> &v) { bool isBegin = true; EACH (e, v) { if (!isBegin) { o << ' '; } isBegin = false; o << e; } return o; } template<class T> std::ostream &operator,(std::ostream &o, const T &t) { return o << t; } struct StdinReader { StdinReader() { std::ios::sync_with_stdio(0); } } stdinReader; #define get stdinReader, template<class T> StdinReader &operator, (StdinReader &sr, T &t) { std::cin >> t; return sr; } template<class T> StdinReader &operator, (StdinReader &sr, std::deque<T> &v) { EACH (x, v) sr, x; return sr; } template<class T, class U> StdinReader &operator, (StdinReader &sr, std::pair<T, U> &p) { return sr, p.first, p.second; } struct GetSizeHelper { int s; operator int () const { return s; } operator bool () const { return s; } template<class T> GetSizeHelper(const T &t) : s((int) size(t)) {} }; #define isize (GetSizeHelper) template <class T, class U> bool remin(T &a, const U &b) { return b < a ? a = b, true : false; } template <class T, class U> bool remax(T &a, const U &b) { return b > a ? a = b, true : false; } const int inf = 1000000001; using ll = long long; // code starts here int cnt(int x) { return bitset<32>(x).count(); } int main() { int sum; get sum; deque<int> v; int cur = 0; while (sum > 0) { ++cur; v.push_front(cur); sum -= cnt(cur); } if (sum) { sum = -sum; for (auto it = v.begin(); it != v.end(); ++it) { if (cnt(*it) == sum) { v.erase(it); sum = 0; break; } } } say v.size(); say v; return sum; }
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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 | #include <bits/stdc++.h> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) #define EACH(it, cont) for (auto &it : cont) #define FOR(i, b, e) for (int i = (b); i <= (e); ++i) #define FORD(i, b, e) for (int i = (b); i >= (e); --i) #define ALL(c) begin(c), end(c) #define dump fancy_dumper::DumpFirst<&std::cerr>(), #define say fancy_dumper::DumpFirst<&std::cout>(), #define $dump fancy_dumper::Dumper<&std::cerr> #define $say fancy_dumper::Dumper<&std::cout> #define $(x) #x, fancy_dumper::ToggleSeparator(), (x),\ fancy_dumper::ToggleSeparator() namespace fancy_dumper { struct ToggleSeparator { }; template<std::ostream *Out> struct DumpFirst { }; template<std::ostream *Out> struct Dumper { static void *&last() { static void *p; return p; } static const char *&separator() { static const char *s = " "; return s; } static const char *&separatorNewLine() { static const char *s = "\n"; return s; } static const char *&unseparator() { static const char *s = "="; return s; } Dumper() { last() = this; } ~Dumper() { if (this == last()) { *Out << separatorNewLine(); last() = 0; } } Dumper operator, (ToggleSeparator) { std::swap(separator(), unseparator()); return Dumper(); } }; template<std::ostream *Out, class T> Dumper<Out> operator,(Dumper<Out>, const T &e) { *Out << Dumper<Out>::separator() << e; return Dumper<Out>(); } template<std::ostream *Out, class T> Dumper<Out> operator, (DumpFirst<Out>, const T &e) { *Out << e; return Dumper<Out>(); } } template<class T, class Y> std::ostream &operator<< (std::ostream &o, const std::pair<T, Y> &p) { return o << p.first << ' ' << p.second; } template<class T> std::ostream &operator<< (std::ostream &o, const std::deque<T> &v) { bool isBegin = true; EACH (e, v) { if (!isBegin) { o << ' '; } isBegin = false; o << e; } return o; } template<class T> std::ostream &operator<< (std::ostream &o, const std::set<T> &v) { bool isBegin = true; EACH (e, v) { if (!isBegin) { o << ' '; } isBegin = false; o << e; } return o; } template<class T> std::ostream &operator,(std::ostream &o, const T &t) { return o << t; } struct StdinReader { StdinReader() { std::ios::sync_with_stdio(0); } } stdinReader; #define get stdinReader, template<class T> StdinReader &operator, (StdinReader &sr, T &t) { std::cin >> t; return sr; } template<class T> StdinReader &operator, (StdinReader &sr, std::deque<T> &v) { EACH (x, v) sr, x; return sr; } template<class T, class U> StdinReader &operator, (StdinReader &sr, std::pair<T, U> &p) { return sr, p.first, p.second; } struct GetSizeHelper { int s; operator int () const { return s; } operator bool () const { return s; } template<class T> GetSizeHelper(const T &t) : s((int) size(t)) {} }; #define isize (GetSizeHelper) template <class T, class U> bool remin(T &a, const U &b) { return b < a ? a = b, true : false; } template <class T, class U> bool remax(T &a, const U &b) { return b > a ? a = b, true : false; } const int inf = 1000000001; using ll = long long; // code starts here int cnt(int x) { return bitset<32>(x).count(); } int main() { int sum; get sum; deque<int> v; int cur = 0; while (sum > 0) { ++cur; v.push_front(cur); sum -= cnt(cur); } if (sum) { sum = -sum; for (auto it = v.begin(); it != v.end(); ++it) { if (cnt(*it) == sum) { v.erase(it); sum = 0; break; } } } say v.size(); say v; return sum; } |