Submission #1195942

---

Source Code Expand

//============================================================================
// Author       : Sun YaoFeng
//============================================================================

//#pragma 	comment(linker, "/STACK:100240000,100240000")
//#include	<cstdio>
//#include	<cstdlib>
//#include	<cstring>
//#include	<algorithm>

#include	<bits/stdc++.h>

using	namespace	std;

#define DB		double
#define	lf		else if
#define I64		long long
#define unt		unsigned int
#define	Rd()	(rand()<<15|rand())
#define For(i,a,b)	for(int i=(int)(a);i<=(int)(b);i++)
#define Rep(i,a,b)	for(int i=(int)(a);i>=(int)(b);i--)

#define	fi	first
#define se	second
#define MK	make_pair
#define pb	push_back
#define PA	pair<int, int>

//#define	min(a,b)	((a)<(b)?(a):(b))
//#define	max(a,b)	((a)<(b)?(b):(a))

#define	CH	(ch=getchar())
int		IN()	{
		int x= 0, f= 0, ch;
		for	(; CH < '0' || ch > '9';)	f= (ch == '-');
		for	(; ch >= '0' && ch <= '9'; CH)	x= x*10 + ch -'0';
		return	f? -x : x;
}

#define n	205

I64		M;

int		N, A[n], B[n];

int		main(){
		cin >> M;
		
		int t= 0;
		for (; (1ll << t) - 1 <= M; t++);
		t--;
		
		M-= (1ll << t) - 1;
		
		N= t;
		For(i, 1, N)	A[i]= B[i]= i;
		
		Rep(d, t, 0)	{
			if	((1ll << d) <= M)	{
				M-= (1ll << d);
				
				N++;
				B[N]= N;
				
				Rep(i, N, d+2)	A[i]= A[i-1];
				A[d+1]= N;
			}
		}
		
		assert(M == 0);
		
		printf("%d\n", 2*N);
		For(i, 1, N)	printf("%d ", A[i]);
		For(i, 1, N)	printf("%d%c", B[i], " \n"[i == N]);
		
		return	0;
}

Submission Info

Judge Result