#include "grader.h"
#include<bits/stdc++.h>
void Solve(){
int i = 1, j = 1, k = 1;
while(i <= 6 && j <= 10 && k <= 6){
if(Theory(i, j, k) == 0)return;
else if(Theory(i, j, k) == 1)i++;
else if(Theory(i, j, k) == 2)j++;
else if(Theory(i, j, k) == 3)k++;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
208 KB |
Output is correct |
2 |
Correct |
22 ms |
208 KB |
Output is correct |
3 |
Correct |
24 ms |
208 KB |
Output is correct |
4 |
Correct |
25 ms |
208 KB |
Output is correct |
5 |
Correct |
30 ms |
208 KB |
Output is correct |
6 |
Correct |
25 ms |
208 KB |
Output is correct |
7 |
Correct |
25 ms |
208 KB |
Output is correct |
8 |
Correct |
18 ms |
208 KB |
Output is correct |
9 |
Correct |
30 ms |
208 KB |
Output is correct |
10 |
Correct |
30 ms |
208 KB |
Output is correct |
11 |
Correct |
29 ms |
208 KB |
Output is correct |
12 |
Correct |
24 ms |
208 KB |
Output is correct |
13 |
Correct |
20 ms |
208 KB |
Output is correct |
14 |
Correct |
39 ms |
208 KB |
Output is correct |
15 |
Correct |
41 ms |
208 KB |
Output is correct |
16 |
Correct |
24 ms |
208 KB |
Output is correct |
17 |
Correct |
25 ms |
208 KB |
Output is correct |
18 |
Correct |
21 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
24 ms |
208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |