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
#include <cstdio>

int t, k, n;
int a[40];

void print(int q)
{
	if (q + 2 == n)
	{
		printf("1+1");
		
		if (a[q] == 1)
		{
			printf("+1");
		}
		return;
	}

	bool bracket = q + 3 == n || a[q + 1] == 1;

	if (bracket)
	{
		printf("(");
		print(q + 1);
		printf(")");
	}
	else
	{
		print(q + 1);
	}

	printf("*(1+1)");

	if (a[q] == 1)
	{
		printf("+1");
	}
}

int main()
{
	scanf("%d", &t);
	while (--t >= 0)
	{
		scanf("%d", &k);

		if (k == 1)
		{
			printf("1\n");
			continue;
		}

		n = 0;
		while (k > 0)
		{
			a[n] = k & 1;
			k >>= 1;
			++n;
		}

		print(0);
		printf("\n");
	}
	return 0;
}