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
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

const long long parting = -2000000000000000000;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    long long tab[n];
    for (int i=0; i<n; i++) {
        cin>>tab[i];
    }
    queue<long long> results;
    vector<long long> nice;

    for (int i=0; i<n; i++) {
        long long numerator = 0;
        long long bound = tab[0];
        for (int j=1; j<=i; j++) {
            numerator += nice[i-j];
            bound = min(bound, tab[j]-numerator);
        }
        nice.push_back(bound);
    }

    int sum = 0;
    for(int i=0; i<n; i++) {    
        sum += nice[i];
        if (sum < tab[i]) {
            cout << "NIE";
            return 0;
        }
    }

    cout << "TAK\n" << n << "\n";

    for (int i=0; i<n; i++) {
        cout << nice[i] << " ";
    }
}