#include <bits/stdc++.h> #define FOR(i, a, b) for(int i = a; i<b; ++i) #define FR(a, b) for(int i = a; i>=b;--i) #define _upgrade cin.tie(0); ios_base::sync_with_stdio(0) #define pb push_back #define mp make_pair #define INF 1e13 using namespace std; typedef long long ll; typedef double db; typedef unsigned long long ull; typedef pair<int, int> iPair; const int MAX = 1e6 + 2; const int M = 1e9 +7; ll n, pr = 0; vector<ll> v, diff; bool check() { FOR(i, 0, n) { ll sum = 0; FOR(j, i, n) { sum += diff[j]; //cout<<sum<<" "<<i<<" "<< if(sum > v[j-i]) return 0; } } return 1; } int main() { _upgrade; cin>>n; v.resize(n); diff.resize(n); FOR(i, 0, n) cin>>v[i]; diff[0] = v[0]; FOR(i, 1, n) diff[i] = v[i] - v[i-1]; if(!check()) cout<<"NIE"; else { cout<<"TAK\n"; cout<<n*(n+1)/2+n<<"\n"; FOR(i, 1, n+1) { FOR(j, 0, i) cout<<diff[j]<<" "; cout<<-2000000<<" "; } } }
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 58 59 60 61 62 | #include <bits/stdc++.h> #define FOR(i, a, b) for(int i = a; i<b; ++i) #define FR(a, b) for(int i = a; i>=b;--i) #define _upgrade cin.tie(0); ios_base::sync_with_stdio(0) #define pb push_back #define mp make_pair #define INF 1e13 using namespace std; typedef long long ll; typedef double db; typedef unsigned long long ull; typedef pair<int, int> iPair; const int MAX = 1e6 + 2; const int M = 1e9 +7; ll n, pr = 0; vector<ll> v, diff; bool check() { FOR(i, 0, n) { ll sum = 0; FOR(j, i, n) { sum += diff[j]; //cout<<sum<<" "<<i<<" "<< if(sum > v[j-i]) return 0; } } return 1; } int main() { _upgrade; cin>>n; v.resize(n); diff.resize(n); FOR(i, 0, n) cin>>v[i]; diff[0] = v[0]; FOR(i, 1, n) diff[i] = v[i] - v[i-1]; if(!check()) cout<<"NIE"; else { cout<<"TAK\n"; cout<<n*(n+1)/2+n<<"\n"; FOR(i, 1, n+1) { FOR(j, 0, i) cout<<diff[j]<<" "; cout<<-2000000<<" "; } } } |