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

4
int n;
5

6
int main() {
7
    cin >> n;
8
    while(n--) {
9
        int x;
10
        cin >> x;
11
        if(x & 1) cout << "-1" << endl;
12
        else {
13
            cout << "0 0 " << (x >> 1) << endl;
14
        }
15
    }
16
    return 0;
17
}

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

4
int T, n, m;
5
int a[100][100];
6

7
void w(int o, int i, int j) {
8
    a[i][j] = a[i + 1][j + 1] = o;
9
    a[i + 1][j] = a[i][j + 1] = (1 - o);
10
}
11

12
int main() {
13
    scanf("%d", &T);
14
    while(T--) {
15
        scanf("%d%d", &n, &m);
16
        for(int i = 1; i <= n; i += 2) {
17
            for(int j = 1; j <= m; j += 2) {
18
                if(j == 1) w(a[i - 1][j], i, j);
19
                else w(a[i][j - 1], i, j);
20
            }
21
        }
22
        for(int i = 1; i <= n; i++) {
23
            for(int j = 1; j <= m; j++) printf("%d%c", a[i][j], " \n"[j == m]);
24
        }
25
    }
26
    return 0;
27
}

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

4
const int maxn = 1e5 + 17;
5
int T, n, ans, l, r;
6
int a[maxn], p[maxn], t[maxn];
7
const int mod = 1e9 + 7;
8

9
void add(int x) {
10
    for(; x <= n; x += (x & -x)) t[x]++;
11
}
12

13
int cal(int x) {
14
    int res = 0;
15
    for(; x; x -= (x & -x)) res += t[x];
16
    return res;
17
}
18

19
int main() {
20
    scanf("%d", &T);
21
    while(T--) {
22
        scanf("%d", &n);
23
        for(int i = 1; i <= n; i++) {
24
            scanf("%d", &a[i]);
25
            p[a[i]] = i;
26
        }
27
        ans = 1, l = n + 1, r = 0;
28
        for(int i = 0; i < n; i++) {
29
            if(p[i] > l && p[i] < r) {
30
                ans = 1ll * ans * (r - l - (cal(r) - cal(l))) % mod;
31
                // cout <<r << " " << l << " " <<  i<< " " << ans << endl;
32
            }
33
            add(p[i]);
34
            l = min(l, p[i]);
35
            r = max(r, p[i]);
36
        }
37
        printf("%d\n", ans);
38
        for(int i = 0; i <= n; i++) t[i] = 0;
39
    }
40
    return 0;
41
}

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

4
const int maxn = 1e4 + 17;
5
int T, n, ans;
6
int a[maxn], cnt[maxn];
7

8
int main() {
9
    scanf("%d", &T);
10
    while(T--) {
11
        ans = 0;
12
        scanf("%d", &n);
13
        for(int i = 1; i <= n; i++) {
14
            scanf("%d", &a[i]);
15
        }
16
        for(int j = 1; j <= n; j++) {
17

18
            int cur = 0;
19
            stack<int> s;
20
            for(int i = 1, tmp = 0; i <= n; i++) {
21
                if(a[i] == j) {
22
                    if(a[i - 1] != j) {
23
                            tmp = 1;
24
                            int tm = 0;
25
                            int sz = s.size();
26
                            while(!s.empty()) {
27
                                int st = s.top(); s.pop();
28
                                tm = max(tm, cnt[st]);
29
                                cnt[st] = 0;
30
                            }
31
                            cur -= max(tm - (sz - tm), sz & 1);
32

33
                    }
34
                    else tmp++;
35
                }
36
                else {
37
                    if(a[i - 1] == j) {
38
                        cur += tmp;
39
                        s.push(a[i]);
40
                        cnt[a[i]]++;
41
                    }
42
                    else {
43
                        s.push(a[i]);
44
                        cnt[a[i]]++;
45
                    }
46
                }
47
                if(i == n) {
48
                    if(a[i] == j) cur += tmp;
49
                    else {
50
                        int tm = 0;
51
                        int sz = s.size();
52
                        while(!s.empty()) {
53
                            int st = s.top(); s.pop();
54
                            tm = max(tm, cnt[st]);
55
                            cnt[st] = 0;
56
                        }
57
                        cur -= max(tm - (sz - tm), sz & 1);
58

59
                    }
60
                }
61
            }
62
            ans = max(ans, cur);
63
        }
64
        printf("%d\n", ans);
65
    }
66
    return 0;
67
}