-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathB_Binary_Colouring.cpp
79 lines (64 loc) · 1.28 KB
/
B_Binary_Colouring.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define forn(i, k, n) for(int i = k; i < n; i++)
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int INF = 1e9;
const ll mod = 1000000007;
void solve(){
ll n;
cin>>n;
vll x(32,0);
int i =0;
while(i<32){
x[i] = (n>>i) & 1;
i++;
}
int p1 = 0, p2 =0;
while(p1<32 && p2<32){
if(x[p1]==1&&x[p2]==0 && p2 - p1> 1){
x[p1] = -1;
x[p2] = 1;
while(p1<p2-1){
p1++;
x[p1] = 0;
}
p1++;
}else if(x[p1]==0){
p1++;
p2 = p1;
}else if(x[p1]==1 && x[p2]==1){
p2++;
}else if(x[p1]==1&&x[p2]==0){
p1 = p2;
}
}
int k = 31;
while(k>=0){
if(x[k]!=0){
break;
}
k--;
}
k++;
cout<<k<<endl;
forn(i,0,k){
cout<<x[i]<<" ";
}
cout<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
cin>>t;
while(t--)
solve();
return 0;
}