#include "grader.h"
#include "cluedo.h"
void Solve(){int a[3]={1,1,1};while(1){int z=Theory(a[0],a[1],a[2]);if(z==0){return;}a[z-1]++;}}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
200 KB |
Output is correct |
2 |
Correct |
9 ms |
200 KB |
Output is correct |
3 |
Correct |
8 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 |
8 ms |
200 KB |
Output is correct |
7 |
Correct |
6 ms |
200 KB |
Output is correct |
8 |
Correct |
10 ms |
200 KB |
Output is correct |
9 |
Correct |
8 ms |
200 KB |
Output is correct |
10 |
Correct |
11 ms |
200 KB |
Output is correct |
11 |
Correct |
9 ms |
200 KB |
Output is correct |
12 |
Correct |
14 ms |
200 KB |
Output is correct |
13 |
Correct |
8 ms |
200 KB |
Output is correct |
14 |
Correct |
5 ms |
200 KB |
Output is correct |
15 |
Correct |
8 ms |
200 KB |
Output is correct |
16 |
Correct |
11 ms |
200 KB |
Output is correct |
17 |
Correct |
11 ms |
200 KB |
Output is correct |
18 |
Correct |
10 ms |
200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
200 KB |
Output is correct |
2 |
Correct |
10 ms |
200 KB |
Output is correct |
3 |
Correct |
9 ms |
200 KB |
Output is correct |
4 |
Correct |
9 ms |
200 KB |
Output is correct |
5 |
Correct |
11 ms |
200 KB |
Output is correct |
6 |
Correct |
9 ms |
200 KB |
Output is correct |
7 |
Correct |
10 ms |
200 KB |
Output is correct |
8 |
Correct |
8 ms |
200 KB |
Output is correct |
9 |
Correct |
8 ms |
200 KB |
Output is correct |
10 |
Correct |
5 ms |
200 KB |
Output is correct |
11 |
Correct |
9 ms |
200 KB |
Output is correct |
12 |
Correct |
6 ms |
200 KB |
Output is correct |
13 |
Correct |
12 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 |
9 ms |
200 KB |
Output is correct |
17 |
Correct |
10 ms |
200 KB |
Output is correct |
18 |
Correct |
9 ms |
200 KB |
Output is correct |