#include <iostream> #include <stdio.h> #include <algorithm> using namespace std; int* generateN(int n); void print(int* arr, int n); bool isValid(int *arr, int n); int main() { unsigned long long n; unsigned long long k; scanf("%llu %llu", &n, &k); int* arr = generateN(n); do{ if(isValid(arr, n)) { --k; } if(k == 0) { cout << "TAK" << endl; print(arr, n); return 0; } } while(next_permutation(arr,arr+n)); cout << "NIE"; return 0; } int* generateN(int n) { int *arr = new int[n]; for(int i = 0 ; i < n ; i++) { arr[i] = i + 1; } return arr; } void print(int* arr, int n) { for(int i = 0 ; i < n ; i++) { cout << arr[i]; cout << " "; } cout << endl; } bool isValid(int *arr, int n) { int count = 0; int countR = 0; for(int i = 0; i < n; i++) { int a = arr[i]; int b = arr[n-1-i]; for(int j = i + 1; j < n; j++) { if(a > arr[j]) count++; if(b > arr[n-1-j]) countR++; } } return count == countR; }
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 | #include <iostream> #include <stdio.h> #include <algorithm> using namespace std; int* generateN(int n); void print(int* arr, int n); bool isValid(int *arr, int n); int main() { unsigned long long n; unsigned long long k; scanf("%llu %llu", &n, &k); int* arr = generateN(n); do{ if(isValid(arr, n)) { --k; } if(k == 0) { cout << "TAK" << endl; print(arr, n); return 0; } } while(next_permutation(arr,arr+n)); cout << "NIE"; return 0; } int* generateN(int n) { int *arr = new int[n]; for(int i = 0 ; i < n ; i++) { arr[i] = i + 1; } return arr; } void print(int* arr, int n) { for(int i = 0 ; i < n ; i++) { cout << arr[i]; cout << " "; } cout << endl; } bool isValid(int *arr, int n) { int count = 0; int countR = 0; for(int i = 0; i < n; i++) { int a = arr[i]; int b = arr[n-1-i]; for(int j = i + 1; j < n; j++) { if(a > arr[j]) count++; if(b > arr[n-1-j]) countR++; } } return count == countR; } |