Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.005 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.004 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Incorrecto
|
0.004 s | 1 KBi |
#12 |
Incorrecto
|
0.004 s | 1 KBi |
#include <stdio.h> #include <stdlib.h> int main(void) { int num = 0; int *numb; int i = 0; scanf("%d", &num); numb = malloc(sizeof(int) * num); while(i < num) scanf("%d", &numb[i++]); i = 0; while(i < num) { if (numb[i] > numb[i + 1]) { printf("Desordenado"); free(numb); return (0); } i++; } printf("Ordenado"); free (numb); return (0); }