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
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cstdlib>
using namespace std;

#define pi pair<int,int>
#define mp(x,y) make_pair(x,y)
#define fi first
#define se second
#define pl pair<long long,long long>
#define pb push_back

int main()
{
    int z,k,a;

    scanf ("%d", &z);

    while (z--)
    {
        scanf ("%d", &k);
        a=0;

        for (; k>1; k/=2)
        {
            if (k%2)
                printf ("(1+(1+1)*");
            else
                printf ("((1+1)*");

            a++;
        }

        printf ("1");

        while (a--)
            printf (")");

        printf ("\n");
    }

    return 0;
}