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
#include <bits/stdc++.h>
using namespace std;

int n;
long long a[310], b[310];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 2; i <= n; i++) {
        for (int j = 1; j < i; j++)
            if (a[i] > a[j]+a[i-j]) {
                cout << "NIE\n";
                return;
            }
    }
    b[1] = a[1];
    for (int i = 2; i <= n; i++) {
        b[i] = a[i]-a[i-1];
        for (int j = 1; j <= i/2; j++) {
            long long sum = 0;
            for (int k = 1; k <= j; k++) {
                sum += b[k];
                if (k > 1)
                    sum -= b[i-k];
            }
            if (b[i] > sum) {
                cout << "NIE\n";
                return;
            }
        }
    }

    cout << "TAK\n";
    cout << n << "\n";
    for (int i = 1; i <= n; i++) {
        if (i > 1)
            cout << ' ';
        cout << b[i];
    }

    cout << "\n";


}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);

    int tt = 1;
    
    while(tt--) {
        solve();
    }

}