Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.026 s | 4 KBi |
#2 |
Correcto
|
0.028 s | 7 KBi |
#3 |
Correcto
|
0.034 s | 5 KBi |
#4 |
Correcto
|
0.032 s | 5 KBi |
#5 |
Correcto
|
0.024 s | 4 KBi |
#6 |
Correcto
|
0.03 s | 3 KBi |
#7 |
Correcto
|
0.022 s | 3 KBi |
#8 |
Correcto
|
0.025 s | 3 KBi |
#9 |
Correcto
|
0.027 s | 3 KBi |
#10 |
Correcto
|
0.024 s | 3 KBi |
#11 |
Correcto
|
0.03 s | 7 KBi |
#12 |
Correcto
|
0.027 s | 4 KBi |
#13 |
Correcto
|
0.034 s | 7 KBi |
#14 |
Correcto
|
0.205 s | 32 KBi |
#15 |
Correcto
|
0.288 s | 16 KBi |
#16 |
Correcto
|
0.304 s | 30 KBi |
#17 |
Correcto
|
0.345 s | 29 KBi |
#18 |
Correcto
|
0.198 s | 30 KBi |
#19 |
Correcto
|
0.264 s | 30 KBi |
#20 |
Correcto
|
0.297 s | 59 KBi |
n = int(input()) numbers = [int(number) for number in input().split()] assert len(numbers) == n split_position = -1 total = sum(numbers) left = 0 for i in range(1, n): left = left + numbers[i - 1] right = total - left if left > 0 and right < 0: split_position = i break if split_position != -1: print(split_position) else: print("Impossible")