#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> t(n + 1); t.push_back(0); for (int i = 1; i <= n; i++) { cin >> t[i]; } bool impossible = false; for (int i = 2; i <= n; i++) { for (int j = 1; j <= i / 2; j++) { if (t[j] + t[i - j] <= t[i]) { impossible = true; break; } } if (impossible) { break; } } if (impossible) { cout << "NIE" << endl; return 0; } cout << "TAK" << endl; cout << n << endl; for (int i = 1; i <= n; i++) { cout << t[i] - t[i - 1] << " "; } cout << endl; return 0; }
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 | #include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> t(n + 1); t.push_back(0); for (int i = 1; i <= n; i++) { cin >> t[i]; } bool impossible = false; for (int i = 2; i <= n; i++) { for (int j = 1; j <= i / 2; j++) { if (t[j] + t[i - j] <= t[i]) { impossible = true; break; } } if (impossible) { break; } } if (impossible) { cout << "NIE" << endl; return 0; } cout << "TAK" << endl; cout << n << endl; for (int i = 1; i <= n; i++) { cout << t[i] - t[i - 1] << " "; } cout << endl; return 0; } |