Submission #1801503

---

Source Code Expand

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
long long n;
int m, i, j, k, x, y, z, a[2005], len;
int main()
{
	cin >> n;
	for(i = 60; i >= 0 && n; i --)
		if (n + 1 - (1ll << i - 1) >= 0)
		{
		//	cout << (1ll << i - 1) - 1 << endl;
			x ++;
			for(j = 1; j <= i; j ++)
				a[++len] = x;
			n -= (1ll << i - 1);
			n ++;
		}
	cout << len << endl;
	for(i = 1; i <= len; i ++)
		cout << a[i] << " ";
}

Submission Info

Judge Result