# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47469 | Just_Solve_The_Problem | Asceticism (JOI18_asceticism) | C++11 | 313 ms | 648 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>
using namespace std;
#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
#define random rand() ^ (rand() << 5)
const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
int n, k;
int a[N], b[N];
int dp[N];
int pr[N], used[N];
main() {
scanf("%d %d", &n, &k);
if (n > 10) return 0;
for (int i = 1; i <= n; i++) {
a[i] = i;
}
int ans = 0;
do {
int res = 0;
int c = 1;
while (c <= n) {
for (int i = 1; i <= n; i++) {
if (a[i] == c) {
c++;
}
}
res++;
}
if (res == k) {
ans++;
}
} while (next_permutation(a + 1, a + n + 1));
cout << ans;
}
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... |