Codeforces Round 948 (Div. 2)的B题，思路就是最后一张图片

#include<bits/stdc++.h>
using namespace std;

void solve()
{
	int n;
	cin >> n;
	if(n == 1)
	{
		cout << 1 << endl;//长度
		cout << 1 << endl;
		return;
	}
	vector<int> a(50);
	int x = n;
	int maxl;
	for( int i = 1 ; x ; i ++ )
	{
		if( x & 1)
		{
			a[i] = 1;
		}
		else 
		{
			a[i] = 0;
		}
		x >>= 1;
		maxl = i;
	}
	// 0111 -> 0 -1 0 0 2
	//遇到连续的1，将第一个变成负一
	while( 1 )
	{
		int f = 1;
		for( int i = 1 ; i <= maxl ; i ++ )
		{
			if(a[i] == 2 )
			{
				f = 0;
				int j = i;
				while(a[j]==2)//自动进位
				{
					a[j] = 0;
					j++;
					if( j > maxl) maxl = j;
					a[j] ++;
				}
			}
			
			if( a[i] == a[i-1] && a[i-1] == 1)
			{
				f = 0;
				a[i-1] = -1;
				a[i] = 0;
				a[i+1]++;
				if( i + 1 > maxl ) maxl = i + 1;//最大长度
			}
		}
		if( f ) break;
	}
	cout << maxl << endl;
	for( int i = 1 ; i <= maxl ; i ++ )
		cout << a[i] << ' ';
	cout << endl;
}

int main()
{
	int _;
	cin >> _;
	while( _ -- )
	{
		solve();
	}
}