Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.003 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.006 s | 1 KBi |
#include <stdio.h> int main(void) { int a, i, b; int c[1024]; scanf("%d", &b); for(i = 0; i < b; i++) { scanf("%d", &c[i]); } a = c[0]; for (i = 1; i < b; i++) { if(a > c[i] && i != (b - 1)) { printf("Desordenado"); break; } a = c[i]; } if (i == b) printf("Ordenado"); return 0; }