Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Incorrecto
|
0.004 s | 1 KBi |
#3 |
Incorrecto
|
0.004 s | 1 KBi |
#4 |
Incorrecto
|
0.004 s | 1 KBi |
#5 |
Incorrecto
|
0.005 s | 3 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 2 KBi |
#8 |
Correcto
|
0.005 s | 55 KBi |
#9 |
Incorrecto
|
0.004 s | 7 KBi |
#10 |
Incorrecto
|
0.004 s | 5 KBi |
#11 |
Correcto
|
0.004 s | 3 KBi |
#12 |
Correcto
|
0.004 s | 1 KBi |
#include <stdio.h> #include <stdlib.h> int main(void) { int num = 0; int f = 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]) f += 1; i++; } if (f == num -1) printf("Ordenado"); else printf("Ordenado"); free (numb); return (0); }