#include "springboard.h"
void Reorder(int N) {
int n = N;
PutBall((n+1)/2);
int t = PutBall((n+1)/2);
int x = (n+1)/2;
for(int i=0;i<14;i++){
x = (x+1) /2;
if (x == 1) {
int q;
q = PutBall(t == -1 ? 1 : n);
if (q == -1)PutBall(1);
break;
}
if (t == -1) {
t = PutBall(x);
}
else {
t = PutBall(n-x+1);
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1128 KB |
Output is correct |
2 |
Correct |
0 ms |
1128 KB |
Output is correct |
3 |
Correct |
0 ms |
1128 KB |
Output is correct |
4 |
Correct |
0 ms |
1128 KB |
Output is correct |
5 |
Correct |
0 ms |
1128 KB |
Output is correct |
6 |
Correct |
0 ms |
1128 KB |
Output is correct |
7 |
Correct |
0 ms |
1128 KB |
Output is correct |
8 |
Correct |
0 ms |
1128 KB |
Output is correct |
9 |
Correct |
0 ms |
1128 KB |
Output is correct |
10 |
Correct |
0 ms |
1128 KB |
Output is correct |
11 |
Correct |
0 ms |
1128 KB |
Output is correct |
12 |
Correct |
0 ms |
1128 KB |
Output is correct |
13 |
Correct |
0 ms |
1128 KB |
Output is correct |
14 |
Correct |
0 ms |
1128 KB |
Output is correct |
15 |
Correct |
0 ms |
1128 KB |
Output is correct |
16 |
Correct |
0 ms |
1128 KB |
Output is correct |
17 |
Correct |
0 ms |
1128 KB |
Output is correct |
18 |
Correct |
0 ms |
1128 KB |
Output is correct |
19 |
Correct |
0 ms |
1128 KB |
Output is correct |
20 |
Correct |
0 ms |
1128 KB |
Output is correct |
21 |
Correct |
0 ms |
1128 KB |
Output is correct |
22 |
Correct |
0 ms |
1128 KB |
Output is correct |
23 |
Correct |
0 ms |
1128 KB |
Output is correct |
24 |
Correct |
0 ms |
1128 KB |
Output is correct |
25 |
Correct |
0 ms |
1128 KB |
Output is correct |
26 |
Correct |
0 ms |
1128 KB |
Output is correct |
27 |
Correct |
0 ms |
1128 KB |
Output is correct |
28 |
Correct |
0 ms |
1128 KB |
Output is correct |
29 |
Correct |
0 ms |
1128 KB |
Output is correct |
30 |
Correct |
0 ms |
1128 KB |
Output is correct |
31 |
Correct |
0 ms |
1128 KB |
Output is correct |
32 |
Correct |
0 ms |
1128 KB |
Output is correct |
33 |
Correct |
3 ms |
1128 KB |
Output is correct |
34 |
Correct |
0 ms |
1128 KB |
Output is correct |
35 |
Correct |
0 ms |
1128 KB |
Output is correct |
36 |
Correct |
0 ms |
1128 KB |
Output is correct |
37 |
Correct |
0 ms |
1128 KB |
Output is correct |
38 |
Correct |
0 ms |
1128 KB |
Output is correct |
39 |
Correct |
0 ms |
1128 KB |
Output is correct |
40 |
Correct |
3 ms |
1128 KB |
Output is correct |
41 |
Correct |
0 ms |
1128 KB |
Output is correct |