def main():
(X, L, N) = map(int, input().split())
flips = 0
S2 = [0 for _ in range(X)]
S1 = [0 for _ in range(X)]
COUNTER = X
while COUNTER > 0:
#print("S1: ", S1)
#print("S2: ", S2)
#print("COUNTER: ", COUNTER)
#print()
S2.append(S1.pop()) #Push the top element of S1 onto S2
#Pop the top element of S1
S1 = [v ^ 1 for v in S1]
flips = flips + 1
if S2[-1] > L:
print(12)
return
#print("conter.dec", flips)
COUNTER = COUNTER - 1
if COUNTER == 0:
print(S2[-1])
#print("total flips: ", flips)
return
else:
S2.append(N)
S2.append(N)
S2.append(S2.pop() + S2.pop())
S2.append(S2.pop() + S2.pop())
S1.append(S2[-1])
S1.append(S2.pop())
S2.pop()
q = int(input())
for i in range(q):
main()
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
465 ms |
19028 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1554 ms |
30704 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1563 ms |
30216 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1557 ms |
7872 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1546 ms |
220172 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1570 ms |
221504 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |