#include <bits/stdc++.h> using namespace std; int main(){ int n, m; cin >> n; vector<int> v; // v.push_bck(0); int k; for(int x = 0; x < n; x ++){ cin >> k; v.push_back(k); } bool pos = true; for(int x = 0; x < n; x ++){ for(int y = 0; y < x; y ++){ if(v[x] > v[y] + v[x-y-1]){ pos = false; goto end; } } } end: if(pos){ cout << "TAK" << endl; cout << n << endl; int sum = 0; for(int x = 0; x < n; x ++){ cout << v[x] - sum << " "; sum = v[x]; } } else{ cout << "NIE\n"; } }
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 main(){ int n, m; cin >> n; vector<int> v; // v.push_bck(0); int k; for(int x = 0; x < n; x ++){ cin >> k; v.push_back(k); } bool pos = true; for(int x = 0; x < n; x ++){ for(int y = 0; y < x; y ++){ if(v[x] > v[y] + v[x-y-1]){ pos = false; goto end; } } } end: if(pos){ cout << "TAK" << endl; cout << n << endl; int sum = 0; for(int x = 0; x < n; x ++){ cout << v[x] - sum << " "; sum = v[x]; } } else{ cout << "NIE\n"; } } |