#include <bits/stdc++.h> #define ll long long int #define pb push_back #define st first #define nd second #define pii pair<int,int> #define mp make_pair #define pll pair<long long,long long> using namespace std; const int nax = 305; ll a[nax]; int n; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; a[0] = 0; bool ok = true; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { int to = i + j; if(to <= n) { if(a[i] + a[j] < a[to]) ok = false; } } } if(ok == false) cout<<"NIE"<<"\n"; else { cout<<"TAK"<<"\n"; cout<<n<<"\n"; for(int i=1;i<=n;i++) cout<<a[i] - a[i - 1]<<" "; cout<<"\n"; } 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 38 39 40 41 42 43 | #include <bits/stdc++.h> #define ll long long int #define pb push_back #define st first #define nd second #define pii pair<int,int> #define mp make_pair #define pll pair<long long,long long> using namespace std; const int nax = 305; ll a[nax]; int n; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; a[0] = 0; bool ok = true; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { int to = i + j; if(to <= n) { if(a[i] + a[j] < a[to]) ok = false; } } } if(ok == false) cout<<"NIE"<<"\n"; else { cout<<"TAK"<<"\n"; cout<<n<<"\n"; for(int i=1;i<=n;i++) cout<<a[i] - a[i - 1]<<" "; cout<<"\n"; } return 0; } |