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


using namespace std;


vector <long long> solve(int n, const vector <int> &a) {
    vector <long long> res;

    for (int i = 0; i < n; i++) {
        long long bound = a[0], sum = 0;

        for (int j = i - 1; j >= 0; j--) {
            sum += res[j];
            bound = min(bound, a[i - j] - sum);
        }

        if (sum + bound < a[i]) {
            return {};
        }

        res.push_back(bound);
    }

    return res;
}


int main() {
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;

    vector <int> a(n);
    for (int &ai : a) {
        cin >> ai;
    }

    auto ans = solve(n, a);

    if (ans.empty()) {
        cout << "NIE\n";
    } else {
        cout << "TAK\n" << n << '\n';

        for (auto &x : ans) {
            cout << x << ' ';
        }
    }

    return 0;
}