#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define mp make_pair #define pb push_back #define pf push_front #define eb emplace_back #define st first #define nd second #define vt vector #define DEBUG if(1) #define VAR(__var) #__var << ": " << __var << " " #define PARA(__var) #__var << ": " << __var.first << ", " << __var.second << " " #define FOR(__var, __start, __end) for(int __var=__start; __var<__end; ++__var) #define FORB(__var, __start, __end) for(int __var=__start; __var>__end; --__var) #define all(__var) (__var).begin(),(__var).end() #define rall(__var) (__var).rbegin(),(__var).rend() #define sz(__var) (int)(__var).size() #define satori(__var) int __var; cin>>__var; while(__var--) using namespace std; using namespace __gnu_pbds; template <typename T> using ord_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const ll INF = 1e13; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n; cin >> n; vt<ll> a(n+2, 0); vt<ll> res; FOR(i, 1, n+1) cin >> a[i]; ll prev = INF; auto go = [](int x) { if(x < 0) return -x; return x; }; FOR(i, 1, n+1) { ll pole = a[i]/i; ll brak = go(a[i]%i); ll dodaj = 0; if(brak > 0 && a[i] > 0) dodaj = 1; else if(brak > 0 && a[i] < 0) dodaj = -1; if(pole + dodaj > prev) { cout << "NIE\n"; return 0; } prev = pole+dodaj; FOR(j, 0, brak) res.pb(pole+dodaj); FOR(j, brak, i) res.pb(pole); if(i != n) res.pb(-INF); } cout << "TAK\n"; cout << sz(res) << '\n'; for(auto x : res) cout << x << ' '; 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 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 | #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define mp make_pair #define pb push_back #define pf push_front #define eb emplace_back #define st first #define nd second #define vt vector #define DEBUG if(1) #define VAR(__var) #__var << ": " << __var << " " #define PARA(__var) #__var << ": " << __var.first << ", " << __var.second << " " #define FOR(__var, __start, __end) for(int __var=__start; __var<__end; ++__var) #define FORB(__var, __start, __end) for(int __var=__start; __var>__end; --__var) #define all(__var) (__var).begin(),(__var).end() #define rall(__var) (__var).rbegin(),(__var).rend() #define sz(__var) (int)(__var).size() #define satori(__var) int __var; cin>>__var; while(__var--) using namespace std; using namespace __gnu_pbds; template <typename T> using ord_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const ll INF = 1e13; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n; cin >> n; vt<ll> a(n+2, 0); vt<ll> res; FOR(i, 1, n+1) cin >> a[i]; ll prev = INF; auto go = [](int x) { if(x < 0) return -x; return x; }; FOR(i, 1, n+1) { ll pole = a[i]/i; ll brak = go(a[i]%i); ll dodaj = 0; if(brak > 0 && a[i] > 0) dodaj = 1; else if(brak > 0 && a[i] < 0) dodaj = -1; if(pole + dodaj > prev) { cout << "NIE\n"; return 0; } prev = pole+dodaj; FOR(j, 0, brak) res.pb(pole+dodaj); FOR(j, brak, i) res.pb(pole); if(i != n) res.pb(-INF); } cout << "TAK\n"; cout << sz(res) << '\n'; for(auto x : res) cout << x << ' '; cout << '\n'; return 0; } |