#include <bits/stdc++.h>
#include "grader.h"
#include "cluedo.h"
using namespace std;
void Solve()
{
int arr[4]= {1,1,1,1};
while(Theory(arr[1],arr[2],arr[3]))
{
int now=Theory(arr[1],arr[2],arr[3]);
arr[now]++;
}
return;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
208 KB |
Output is correct |
2 |
Correct |
16 ms |
208 KB |
Output is correct |
3 |
Correct |
12 ms |
208 KB |
Output is correct |
4 |
Correct |
19 ms |
208 KB |
Output is correct |
5 |
Correct |
18 ms |
208 KB |
Output is correct |
6 |
Correct |
16 ms |
208 KB |
Output is correct |
7 |
Correct |
19 ms |
208 KB |
Output is correct |
8 |
Correct |
14 ms |
208 KB |
Output is correct |
9 |
Correct |
20 ms |
208 KB |
Output is correct |
10 |
Correct |
15 ms |
208 KB |
Output is correct |
11 |
Correct |
10 ms |
208 KB |
Output is correct |
12 |
Correct |
20 ms |
208 KB |
Output is correct |
13 |
Correct |
15 ms |
208 KB |
Output is correct |
14 |
Correct |
15 ms |
208 KB |
Output is correct |
15 |
Correct |
16 ms |
208 KB |
Output is correct |
16 |
Correct |
20 ms |
208 KB |
Output is correct |
17 |
Correct |
14 ms |
208 KB |
Output is correct |
18 |
Correct |
21 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
14 ms |
208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |