#include "grader.h"
#include "cluedo.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(){
for(int i=1;i<=6;i++)
for(int j=1;j<=10;j++)
for(int k=1;k<=6;k++){
Theory(i,j,k);
}
return;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
175 ms |
344 KB |
Output is correct |
2 |
Correct |
170 ms |
344 KB |
Output is correct |
3 |
Correct |
217 ms |
344 KB |
Output is correct |
4 |
Correct |
149 ms |
344 KB |
Output is correct |
5 |
Correct |
177 ms |
344 KB |
Output is correct |
6 |
Correct |
154 ms |
344 KB |
Output is correct |
7 |
Correct |
164 ms |
344 KB |
Output is correct |
8 |
Correct |
163 ms |
344 KB |
Output is correct |
9 |
Correct |
166 ms |
340 KB |
Output is correct |
10 |
Correct |
176 ms |
344 KB |
Output is correct |
11 |
Correct |
183 ms |
344 KB |
Output is correct |
12 |
Correct |
176 ms |
344 KB |
Output is correct |
13 |
Correct |
160 ms |
344 KB |
Output is correct |
14 |
Correct |
158 ms |
344 KB |
Output is correct |
15 |
Correct |
201 ms |
344 KB |
Output is correct |
16 |
Correct |
169 ms |
344 KB |
Output is correct |
17 |
Correct |
156 ms |
344 KB |
Output is correct |
18 |
Correct |
148 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
174 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |