#include<bits/stdc++.h> using namespace std; int n,w[305]; long long b[100005],s[305],p; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin>>n; cin>>w[1]; s[1] = w[1]; b[1] = w[1]; for(int i = 2;i <= n; i++) { cin>>w[i]; p = w[i] - s[i - 1]; long long m = p; for(int j = i;j > 0; j--) if(s[j - 1] + p > w[j]) { cout<<"NIE"; return 0; } for(int j = i;j > 0; j--) s[j] = s[j - 1] + p; b[i] = p; } 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 | #include<bits/stdc++.h> using namespace std; int n,w[305]; long long b[100005],s[305],p; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin>>n; cin>>w[1]; s[1] = w[1]; b[1] = w[1]; for(int i = 2;i <= n; i++) { cin>>w[i]; p = w[i] - s[i - 1]; long long m = p; for(int j = i;j > 0; j--) if(s[j - 1] + p > w[j]) { cout<<"NIE"; return 0; } for(int j = i;j > 0; j--) s[j] = s[j - 1] + p; b[i] = p; } cout<<"TAK\n"<<n<<'\n'; for(int i = 1;i <= n; i++) cout<<b[i]<<" "; return 0; } |