#include <bits/stdc++.h>
using namespace std;
#include "grader.h"
#include "cluedo.h"
void Solve(){
array<int,3> arr = {0 , 1 , 1};
int x = 1;
do {
arr[x-1]++;
x = Theory(arr[0] , arr[1] , arr[2]);
}while(x != 0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
200 KB |
Output is correct |
2 |
Correct |
14 ms |
200 KB |
Output is correct |
3 |
Correct |
11 ms |
200 KB |
Output is correct |
4 |
Correct |
10 ms |
200 KB |
Output is correct |
5 |
Correct |
10 ms |
200 KB |
Output is correct |
6 |
Correct |
11 ms |
280 KB |
Output is correct |
7 |
Correct |
8 ms |
200 KB |
Output is correct |
8 |
Correct |
10 ms |
200 KB |
Output is correct |
9 |
Correct |
11 ms |
200 KB |
Output is correct |
10 |
Correct |
15 ms |
200 KB |
Output is correct |
11 |
Correct |
12 ms |
200 KB |
Output is correct |
12 |
Correct |
9 ms |
200 KB |
Output is correct |
13 |
Correct |
13 ms |
200 KB |
Output is correct |
14 |
Correct |
9 ms |
200 KB |
Output is correct |
15 |
Correct |
9 ms |
200 KB |
Output is correct |
16 |
Correct |
10 ms |
200 KB |
Output is correct |
17 |
Correct |
10 ms |
200 KB |
Output is correct |
18 |
Correct |
12 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
200 KB |
Output is correct |
2 |
Correct |
10 ms |
200 KB |
Output is correct |
3 |
Correct |
11 ms |
200 KB |
Output is correct |
4 |
Correct |
9 ms |
200 KB |
Output is correct |
5 |
Correct |
9 ms |
200 KB |
Output is correct |
6 |
Correct |
13 ms |
200 KB |
Output is correct |
7 |
Correct |
11 ms |
200 KB |
Output is correct |
8 |
Correct |
12 ms |
200 KB |
Output is correct |
9 |
Correct |
8 ms |
200 KB |
Output is correct |
10 |
Correct |
8 ms |
256 KB |
Output is correct |
11 |
Correct |
8 ms |
200 KB |
Output is correct |
12 |
Correct |
10 ms |
200 KB |
Output is correct |
13 |
Correct |
8 ms |
200 KB |
Output is correct |
14 |
Correct |
10 ms |
200 KB |
Output is correct |
15 |
Correct |
8 ms |
200 KB |
Output is correct |
16 |
Correct |
8 ms |
200 KB |
Output is correct |
17 |
Correct |
9 ms |
200 KB |
Output is correct |
18 |
Correct |
11 ms |
200 KB |
Output is correct |