| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 503705 |
2022-01-08T16:00:58 Z |
Stickfish |
NoM (RMI21_nom) |
C++17 |
|
500 ms |
264 KB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
signed main() {
int n, m;
cin >> n >> m;
vector<int> a(n * 2);
for (int i = 0; i < n * 2; ++i)
a[i] = i;
vector<int> ca = a;
int ans = 0;
do {
++ans;
for (int i = 0; i < 2 * n; i += 2) {
if (a[i] % m == a[i + 1] % m) {
//for (auto x : a)
//cout << x << ' ';
//cout << endl;
--ans;
break;
}
}
next_permutation(a.begin(), a.end());
} while (ca != a);
cout << ans << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
2 ms |
204 KB |
Output is correct |
| 9 |
Correct |
41 ms |
204 KB |
Output is correct |
| 10 |
Correct |
142 ms |
264 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
2 ms |
204 KB |
Output is correct |
| 9 |
Correct |
41 ms |
204 KB |
Output is correct |
| 10 |
Correct |
142 ms |
264 KB |
Output is correct |
| 11 |
Execution timed out |
1090 ms |
204 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
2 ms |
204 KB |
Output is correct |
| 9 |
Correct |
41 ms |
204 KB |
Output is correct |
| 10 |
Correct |
142 ms |
264 KB |
Output is correct |
| 11 |
Execution timed out |
1090 ms |
204 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
2 ms |
204 KB |
Output is correct |
| 9 |
Correct |
41 ms |
204 KB |
Output is correct |
| 10 |
Correct |
142 ms |
264 KB |
Output is correct |
| 11 |
Execution timed out |
1090 ms |
204 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
2 ms |
204 KB |
Output is correct |
| 9 |
Correct |
41 ms |
204 KB |
Output is correct |
| 10 |
Correct |
142 ms |
264 KB |
Output is correct |
| 11 |
Execution timed out |
1090 ms |
204 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
