#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int n, m;
int main(){
cin >> n >> m;
vector<int> vec;
for (int i = 1; i <= 2 * n; i ++)
vec.push_back(i);
int ans = 0;
do{
bool bad = 0;
for (int i = 0; i < vec.size(); i ++){
for (int j = i + 1; j < vec.size(); j ++){
int x = vec[i], y = vec[j];
if (x > n) x -= n;
if (y > n) y -= n;
if (x == y and (j - i) % m == 0) bad = 1;
}
}
ans += !bad;
}while (next_permutation(vec.begin(), vec.end()));
cout << ans << endl;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |