Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.005 s | 1 KBi |
#2 |
Incorrecto
|
0.005 s | 1 KBi |
#3 |
Correcto
|
0.003 s | 2 KBi |
#4 |
Correcto
|
0.002 s | 1 KBi |
#5 |
Incorrecto
|
0.002 s | 2 KBi |
#6 |
Incorrecto
|
0.005 s | 1 KBi |
#7 |
Incorrecto
|
0.005 s | 1 KBi |
#8 |
Incorrecto
|
0.007 s | 2 KBi |
#9 |
Incorrecto
|
0.027 s | 2 KBi |
#10 |
Incorrecto
|
0.017 s | 2 KBi |
#11 |
Incorrecto
|
0.023 s | 2 KBi |
#12 |
Incorrecto
|
0.026 s | 2 KBi |
#13 |
Incorrecto
|
0.02 s | 2 KBi |
#14 |
Incorrecto
|
0.024 s | 2 KBi |
#include <stdio.h> #include <stdlib.h> int main() { int N, c, i = 0, j, k, *arr, *consultas, res; fscanf(stdin, "%d", &N); arr = (int *)malloc(sizeof(int) * N); while (i < N && fscanf(stdin, "%d", &arr[i++]) == 1) ; fscanf(stdin, "%d", &c); consultas = (int *)malloc(sizeof(int) * c * 2); //leer cada consulta, calcular su resultado e imprimirlo for (i = 0; i < c; i++) { j = 0; fscanf(stdin, "%d %d", consultas + i * 2, consultas + i * 2 + 1); res = 0; // for (k = *(consultas + i * 2); k <= *(consultas + i * 2 + 1); k++) // { // res += arr[k]; // } printf("%d\n", res); } free(consultas); free(arr); return 0; }