Submission #1801642

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
using namespace std;
int n,m;
inline int read()
{
	char c;
	int res,flag=0;
	while((c=getchar())>'9'||c<'0') if(c=='-')flag=1;
	res=c-'0';
	while((c=getchar())>='0'&&c<='9') res=(res<<3)+(res<<1)+c-'0';
	return flag?-res:res;
}
struct cc
{
	int l,r,num[210];
};
cc ksm(int x,int y)
{
	cc t;
	if(x==1)
	{
		memset(t.num,0,sizeof(t.num));
		t.l=100;
		t.r=101;
		return t;
	}
	t=ksm(x/2,y+1);
	t.num[++t.r]=y;
	if(x&1) t.num[--t.l]=y;
	return t;
}
int ans;
int main()
{
//	freopen("C.in","r",stdin);
//	freopen(".out","w",stdout);
	n=read();
	++n;
	cc t=ksm(n,1);
	for(int i=t.l;i<=t.r;++i)
	if(t.num[i]) ++ans;
	printf("%d\n",ans*2);
	for(int i=t.l;i<=t.r;++i)
	if(t.num[i])
	printf("%d ",t.num[i]);
	for(int i=1;i<=ans;++i)
	printf("%d ",i);
}

Submission Info

Judge Result