#include <iostream> #include <vector> #include <ctime> #include <algorithm> using namespace std; int countInversions(vector<int> &permutation) { int inversionsCounter = 0; for (int i = 0; i < permutation.size() - 1; ++i) { for (int j = i + 1; j < permutation.size(); ++j) { if (permutation[i] > permutation[j]) { ++inversionsCounter; } } } return inversionsCounter; } bool isStable(vector<int> permutation) { int inversionCounter = countInversions(permutation); reverse(permutation.begin(), permutation.end()); inversionCounter -= countInversions(permutation); return inversionCounter == 0; } void printPermutation(vector<int> &permutation) { for (int el : permutation) { cout << el << " "; } } void generateAllPermutations(vector<int> &permutation, const int permutationNumber) { int generatedStablePermutation = 0; do { if (isStable(permutation)) { generatedStablePermutation++; if (generatedStablePermutation == permutationNumber) { cout << "TAK" << endl; printPermutation(permutation); return; } } } while (next_permutation(permutation.begin(), permutation.end())); cout << "NIE " << endl; } vector<int> create(const int size) { vector<int> result; for (int i = 1; i <= size; ++i) { result.push_back(i); } return result; }; int main() { ios_base::sync_with_stdio(false); int permutationSize = 1; int permutationNumber = 1; cin >> permutationSize >> permutationNumber; vector<int> startPermutation = create(permutationSize); generateAllPermutations(startPermutation, permutationNumber); }
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 | #include <iostream> #include <vector> #include <ctime> #include <algorithm> using namespace std; int countInversions(vector<int> &permutation) { int inversionsCounter = 0; for (int i = 0; i < permutation.size() - 1; ++i) { for (int j = i + 1; j < permutation.size(); ++j) { if (permutation[i] > permutation[j]) { ++inversionsCounter; } } } return inversionsCounter; } bool isStable(vector<int> permutation) { int inversionCounter = countInversions(permutation); reverse(permutation.begin(), permutation.end()); inversionCounter -= countInversions(permutation); return inversionCounter == 0; } void printPermutation(vector<int> &permutation) { for (int el : permutation) { cout << el << " "; } } void generateAllPermutations(vector<int> &permutation, const int permutationNumber) { int generatedStablePermutation = 0; do { if (isStable(permutation)) { generatedStablePermutation++; if (generatedStablePermutation == permutationNumber) { cout << "TAK" << endl; printPermutation(permutation); return; } } } while (next_permutation(permutation.begin(), permutation.end())); cout << "NIE " << endl; } vector<int> create(const int size) { vector<int> result; for (int i = 1; i <= size; ++i) { result.push_back(i); } return result; }; int main() { ios_base::sync_with_stdio(false); int permutationSize = 1; int permutationNumber = 1; cin >> permutationSize >> permutationNumber; vector<int> startPermutation = create(permutationSize); generateAllPermutations(startPermutation, permutationNumber); } |