Submission #290849

#	Time	Username	Problem	Language	Result	Execution time	Memory
290849		blue	Asceticism (JOI18_asceticism)	C++11	0 / 100	1 ms	256 KiB

asceticism

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

//4 pts: N <= 10
int main()
{
    int N, K;
    cin >> N >> K;

    vector<int> X(N);
    for(int i = 1; i <= N; i++) X[i-1] = i;

    int res = 0;
    int a;
    while(next_permutation(X.begin(), X.end()))
    {
        a = 1;
        for(int i = 1; i < N; i++) if(X[i-1] > X[i]) a++;
        if(a == K) res++;
    }
    cout << res << '\n';
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 20
• Subtask 3: 0 / 25
• Subtask 4: 0 / 51