#include <iostream> #include <vector> using namespace std; int main() { long long n, k; long long test=0; cin >> n >> k; for (int i=1; i<n; i++) { test += i; } // cout << test << endl; if (test/2!=k || test%2==1) { cout << "NIE"; return 0; } else { vector <int> Perm; int help=0, a=n-1; // cout << "hej"; while (help!=test/2) { if (help+a <= test/2 && a>0) { help += a; Perm.push_back(a); } a--; if (a<0) { cout << "NIE"; return 0; } } cout << "TAK" << endl; int b=0; for (int i=1; i<=n; i++) { if (n-Perm[b]==i) { cout << n << " "; n--; b++; i--; } else { cout << i << " "; } } } }
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 | #include <iostream> #include <vector> using namespace std; int main() { long long n, k; long long test=0; cin >> n >> k; for (int i=1; i<n; i++) { test += i; } // cout << test << endl; if (test/2!=k || test%2==1) { cout << "NIE"; return 0; } else { vector <int> Perm; int help=0, a=n-1; // cout << "hej"; while (help!=test/2) { if (help+a <= test/2 && a>0) { help += a; Perm.push_back(a); } a--; if (a<0) { cout << "NIE"; return 0; } } cout << "TAK" << endl; int b=0; for (int i=1; i<=n; i++) { if (n-Perm[b]==i) { cout << n << " "; n--; b++; i--; } else { cout << i << " "; } } } } |