#include "bulb.h"
int A[2010], i, n;
void Init(int N) {
n=N;
for(i=1; i<=n; i++)
A[i]=0;
}
int MakeTurn(int M) {
A[M]=1;
for(i=1; i<=n; i++)
if(A[i]==0)
break;
A[i]=1;
return i;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1136 KB |
Output is correct |
2 |
Correct |
0 ms |
1136 KB |
Output is correct |
3 |
Correct |
0 ms |
1136 KB |
Output is correct |
4 |
Correct |
0 ms |
1136 KB |
Output is correct |
5 |
Correct |
0 ms |
1136 KB |
Output is correct |
6 |
Correct |
0 ms |
1136 KB |
Output is correct |
7 |
Correct |
0 ms |
1136 KB |
Output is correct |
8 |
Correct |
0 ms |
1136 KB |
Output is correct |
9 |
Correct |
0 ms |
1136 KB |
Output is correct |
10 |
Correct |
0 ms |
1136 KB |
Output is correct |
11 |
Correct |
0 ms |
1136 KB |
Output is correct |
12 |
Correct |
0 ms |
1136 KB |
Output is correct |
13 |
Correct |
0 ms |
1136 KB |
Output is correct |
14 |
Correct |
0 ms |
1136 KB |
Output is correct |
15 |
Correct |
0 ms |
1136 KB |
Output is correct |
16 |
Correct |
0 ms |
1136 KB |
Output is correct |
17 |
Correct |
0 ms |
1136 KB |
Output is correct |
18 |
Correct |
0 ms |
1136 KB |
Output is correct |
19 |
Correct |
0 ms |
1136 KB |
Output is correct |
20 |
Correct |
0 ms |
1136 KB |
Output is correct |
21 |
Correct |
0 ms |
1136 KB |
Output is correct |
22 |
Correct |
0 ms |
1136 KB |
Output is correct |