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
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    int n;

    cin >> n;

    vector<long long> max_d(n);
    vector<long long> d(2*n);
    vector<bool> possible(n);

    for (int i = 0; i < n; i++)
    {
        cin >> max_d[i];
    }

    for (int j = 0; j < 2 * n; j++)
    {
        d[j] = max_d[0];
    }

    for (int i = 1; i < n; i++)
    {
        long long current_sum = 0;

        for (int j = 0; j <= i; j++)
        {
            current_sum += d[j];
        }
        
        for (int j = i + 1; j < 2 * n; j++)
        {    
            if (current_sum > max_d[i])
            {
                d[j - 1] -= current_sum - max_d[i];
                current_sum = max_d[i]; 
                j--;
            }
            else
            {
                current_sum += d[j];
                current_sum -= d[j - (i + 1)];
            }    
        }

        if (current_sum > max_d[i])
        {
            d[2 * n - 1] -= current_sum - max_d[i];
        }
    }

    for (int i = 1; i < n; i++)
    {
        long long current_sum = 0;

        for (int j = 0; j <= i; j++)
        {
            current_sum += d[j];
        }

        for (int j = i + 1; j < 2 * n; j++)
        {
            if (current_sum == max_d[i])
            {
                possible[i] = true;
                break;
            }
            else
            {
                current_sum += d[j];
                current_sum -= d[j - (i + 1)];
            }
        }
    }

    //for (int i = 0; i < 2 * n; i++)
    //{
    //    cout << d[i] << " ";
    //}
    
    //cout << endl;
    
    possible[0] = true;

    bool allPossible = true;

    for (int i = 0; i < n; i++)
    {
        //cout << i << ": " << possible[i] << " ";

        if (!possible[i])
        {
            allPossible = false;
        }
    }

    if (allPossible)
    {
        cout << "TAK" << endl;
        cout << 2 * n << endl;

        long long current = 0;
        
        for (int i = 0; i < 2 * n; i++)
        {
            cout << d[i] << " ";
        }
    }
    else
    {
        cout << "NIE";
    }

    cout << endl;


}