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
#include <cstdio>
#include <algorithm>
using namespace std;

const int maxb = 30;

int cnt;

void solution(int *b, int l) {

	if(l == 1) {

		printf("1*1");
		cnt += 2;
		return;
	}

	if(b[0] == 1) {

		printf("1+");
		cnt++;
	}

	printf("(1+1)*(");
	cnt += 2;

	solution(b + 1, l - 1);

	printf(")");
}

int main() {

	int b[maxb] = {0};
	int t, k;

	scanf("%d", &t);

	while(t--) {

		scanf("%d", &k);

		int l;

		for(l = 0; k; ++l) {

			b[l] = k & 1;
			k /= 2;
		}

		cnt = 0;

		solution(b, l);
		printf("\n");
	}
}