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

using namespace std;

int n, k, p, result;

int getTime(vector<int> arr) {
    int result = 0;

    while (arr.size() > 1) {
        vector<int> x;

        for (int i = 0; i < arr.size(); i++) {
            if (i == 0 && arr[i] > arr[i + 1]) {
                x.push_back(arr[i]);
            } else if (i == arr.size() - 1 && arr[i] > arr[i - 1]) {
                x.push_back(arr[i]);
            } else if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) {
                x.push_back(arr[i]);
            }
        }

        arr = x;
        result++;
    }

    return result;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k >> p;

    vector<int> arr;
    for (int i = 0; i < n; i++) {
        arr.push_back(i);
    }

    do {
        if (getTime(arr) == k) {
            result = result + 1 % p;
        }

    } while (next_permutation(arr.begin(), arr.end()));

    cout << result << endl;

    return 0;
}