#include <bits/stdc++.h> using namespace std; #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define ll long long int mod=1000000007; int inf=1000000007; ll infl=1000000000000000007; int a[307]; int b[307]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++) { b[i]=a[i]-a[i-1]; int sum=0; for(int j=i;j>0;j--) { sum+=b[j]; if(sum>a[i-j+1]) { cout<<"NIE"; return 0; } } } cout<<"TAK"<<endl<<n<<endl; 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 38 39 40 41 42 43 44 45 | #include <bits/stdc++.h> using namespace std; #define st first #define nd second #define pb push_back #define sz(x) (int)(x).size() #define ll long long int mod=1000000007; int inf=1000000007; ll infl=1000000000000000007; int a[307]; int b[307]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++) { b[i]=a[i]-a[i-1]; int sum=0; for(int j=i;j>0;j--) { sum+=b[j]; if(sum>a[i-j+1]) { cout<<"NIE"; return 0; } } } cout<<"TAK"<<endl<<n<<endl; for(int i=1;i<=n;i++) cout<<b[i]<<" "; return 0; } |