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

void test_case() {
    int n;
    cin >> n;
    vector<int> a(n+1);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    bool yes = true;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j < i; j++) {
            if (a[j] + a[i-j] < a[i])
                yes = false;
        }
    }
    if (!yes) {
        cout << "NIE" << '\n';
        return; 
    }
    cout << "TAK" << '\n';
    int k = n;
    cout << k << '\n';
    for (int j = 1; j <= n; j++) {
        cout << a[j] - a[j-1] << ' ';
    }
    cout << '\n';
}

void solve() {
    test_case();
}

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