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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	int n;
	long long k, kakt = 0;
	cin >> n >> k;
	vector<int> t;
	for (int i = 0; i < n; i++)
	{
		t.push_back(i+1);
	}

	int a, b;
	do
	{
		a = b = 0;
		for (int i = 0; i < n; i++)
		{
			for (int j = i + 1; j < n; j++)
			{
				if (t[j] < t[i])
				{
					a++;
				}
				if (t[j] > t[i])
				{
					b++;
				}
			}
		}
		if (a == b)
		{
			kakt++;
		}
		if (kakt == k)
			break;
	} while (next_permutation(t.begin(), t.end()));

	if (kakt == k)
	{
		cout << "TAK" << endl;
		for (int i = 0; i < n; i++)
		{
			cout << t[i] << " ";
		}
	}
	else
	{
		cout << "NIE" << endl;
	}
	return 0;
}