Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.002 s | 1 KBi |
#2 |
Correcto
|
0.002 s | 1 KBi |
#3 |
Correcto
|
0.003 s | 1 KBi |
#4 |
Correcto
|
0.003 s | 2 KBi |
#5 |
Correcto
|
0.001 s | 1 KBi |
#6 |
Correcto
|
0.002 s | 2 KBi |
#7 |
Correcto
|
0.001 s | 1 KBi |
#8 |
Correcto
|
0.007 s | 1 KBi |
#9 |
Correcto
|
0.007 s | 1 KBi |
#10 |
Correcto
|
0.004 s | 1 KBi |
#11 |
Correcto
|
0.004 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#13 |
Correcto
|
0.002 s | 2 KBi |
#14 |
Correcto
|
0.083 s | 3 KBi |
#15 |
Correcto
|
0.053 s | 3 KBi |
#16 |
Correcto
|
0.063 s | 3 KBi |
#17 |
Correcto
|
0.068 s | 3 KBi |
#18 |
Correcto
|
0.052 s | 3 KBi |
#19 |
Correcto
|
0.055 s | 3 KBi |
#20 |
Correcto
|
0.049 s | 3 KBi |
#include <stdio.h> #include <stdlib.h> #include <string.h> int main() { int N, *arr, res = -1, i = 0, j = 0, sumIzq = 0, sumDer = 0, puntoDeCorte; fscanf(stdin, "%d", &N); arr = (int *)malloc(sizeof(int) * N); while (j < N && fscanf(stdin, "%d", arr + j++) == 1) ; for (i = 0; i < N; i++) { sumDer += arr[i]; } for (i = 0; i < N; i++) { sumDer -= arr[i]; sumIzq += arr[i]; // printf("sumDer = %d - %d = %d\n", sumDer, arr[i], sumDer - arr[i]); // printf("sumIzq = %d sumDer = %d\n", sumIzq, sumDer); if (sumDer < 0 && sumIzq > 0) { res = i + 1; break; } } if (res != -1) { printf("%d\n", res); } else { printf("Impossible\n"); } free(arr); return 0; }