Submission #1195381

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define SZ(x) (int((x).size()))
#define ALL(x) (x).begin(), (x).end()

template<typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

typedef long long LL;

const int oo = 0x3f3f3f3f;

const int maxs = 210;

LL n;

int n_le = 0;
int le[maxs + 5];
int n_ri = 0;
int ri[maxs + 5];

int main()
{
#ifdef matthew99
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	cin >> n;
	++n;
	int first_bit = -1;
	for (int i = 40; i >= 0; --i) if (n >> i & 1) { first_bit = i; break; }
	int now = 0;
	for (int i = first_bit - 1; i >= 0; --i)
	{
		++now;
		le[n_le++] = now;
		ri[n_ri++] = now;
		if (n >> i & 1) 
		{
			++now;
			le[n_le++] = now;
			ri[n_ri++] = now;
			rotate(ri, ri + (n_ri) - 1, ri + n_ri);
		}
	}
	printf("%d\n", n_le + n_ri);
	REP(i, 0, n_le) printf("%d ", le[i]);
	REP(i, 0, n_ri) printf("%d ", ri[i]);
	return 0;
}

Submission Info

Judge Result