# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47463 | Talant | Asceticism (JOI18_asceticism) | C++17 | 56 ms | 788 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define int long long
using namespace std;
const int inf = (int)1e9 + 7;
const int N = (int)2e5 + 7;
int n,k;
int a[N];
int ans;
main() {
cin >> n >> k;
if (n <= 10) {
for (int i = 1; i <= n; i ++)
a[i] = i;
do {
int c = 0;
for (int i = 2; i <= n; i ++) {
if (a[i - 1] > a[i])
c ++;
}
if (c == k - 1)
ans ++;
}while(next_permutation(a + 1,a + n + 1));
cout << ans << endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |