Submission #645556

#TimeUsernameProblemLanguageResultExecution timeMemory
645556VanillaNoM (RMI21_nom)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; typedef long long int64; int main() { int n,m; cin >> n >> m; vector <int> v(2 * n); for (int i = 0; i < n * 2; i++){ v[i] = (i / 2) + 1; } int rs = 0; do { bool f = 1; int p[2 * n] = {}; for (int i = 0; i < n; i++){ p[i] = -1; } for (int i = 0; i < n * 2; i++){ if (p[v[i]] == -1) { p[v[i]] = 1; } else { if ((i - (p[v[i]])) % m == 0) { f = 0; } } } rs+=f; } while (next_permutation(v.begin(), v.end())); cout << rs << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...