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
#include<bits/stdc++.h>
#define lim 1009

using namespace std;

int n,k,p,t[lim],tab[lim];
vector<int> v1,v2;

int main()
{
    scanf("%d%d%d", &n, &k, &p);
    for(int i = 0;i<n;++i)
    {
        t[i] = i+1;
    }
    int w = 0;
    do
    {
        //for(int i = 0;i<n;++i) printf("%d ", t[i]);printf("\n");
        v1.clear();
        for(int i = 0;i<n;++i)
        {
            v1.push_back(t[i]);
        }
        int ii = 0;
        for(;ii<k;++ii)
        {
            v2.clear();
            if(v1[0]>=v1[1])
            {
                v2.push_back(v1[0]);
            }
            for(int i = 1;i<v1.size()-1;++i)
            {
                if((v1[i]>=v1[i-1])&&(v1[i]>=v1[i+1]))
                {
                    v2.push_back(v1[i]);
                }
            }
            if(v1[v1.size()-1]>=v1[v1.size()-2])
            {
                v2.push_back(v1[v1.size()-1]);
            }
            swap(v1,v2);
            if(v1.size()==1)
            {
                break;
            }
        }
        if(ii==k-1)
        {
            ++w;
        }
    }
    while(next_permutation(t,t+n));
    printf("%d\n", w);
    return 0;
}