#include <bits/stdc++.h> using namespace std; #define f first #define s second #define pb push_back typedef pair <int, int> pii; typedef long long ll; typedef double db; const int N = 300; int n; ll a[N + 5], b[N + 5]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for(int i=1; i<=n; i++){ cin >> a[i]; b[i] = a[i] - a[i - 1]; for(int j=i; j; j--){ if(a[j] + a[i - j] < a[i]){ return cout << "NIE\n", 0; } } } cout << "TAK\n" << n << "\n"; for(int i=1; i<=n; i++){ cout << b[i] << " "; } 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 36 37 | #include <bits/stdc++.h> using namespace std; #define f first #define s second #define pb push_back typedef pair <int, int> pii; typedef long long ll; typedef double db; const int N = 300; int n; ll a[N + 5], b[N + 5]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for(int i=1; i<=n; i++){ cin >> a[i]; b[i] = a[i] - a[i - 1]; for(int j=i; j; j--){ if(a[j] + a[i - j] < a[i]){ return cout << "NIE\n", 0; } } } cout << "TAK\n" << n << "\n"; for(int i=1; i<=n; i++){ cout << b[i] << " "; } return 0; } |