Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 1 KBi |
#2 |
Incorrecto
|
0.003 s | 1 KBi |
#3 |
Incorrecto
|
0.004 s | 1 KBi |
#4 |
Incorrecto
|
0.004 s | 1 KBi |
#5 |
Incorrecto
|
0.003 s | 1 KBi |
#6 |
Correcto
|
0.004 s | 2 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.003 s | 1 KBi |
#9 |
Incorrecto
|
0.004 s | 1 KBi |
#10 |
Incorrecto
|
0.004 s | 1 KBi |
#11 |
Correcto
|
0.004 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#include <stdio.h> int main () { int n,arr [n]; int i, check; while ((i <= sizeof (arr) / sizeof (int)) && (check == 0)) { if ((arr [i]) > (arr [i] + 1)) { check = 1; } i ++; } if (check == 1) { printf ("Desordenado"); } else { printf ("Ordenado"); } }