Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.016 s | 3 KBi |
#2 |
Correcto
|
0.023 s | 3 KBi |
#3 |
Correcto
|
0.017 s | 3 KBi |
#4 |
Correcto
|
0.019 s | 3 KBi |
#5 |
Correcto
|
0.024 s | 3 KBi |
#6 |
Incorrecto
|
0.019 s | 3 KBi |
#7 |
Incorrecto
|
0.014 s | 3 KBi |
#8 |
Incorrecto
|
0.02 s | 3 KBi |
#9 |
Correcto
|
0.022 s | 3 KBi |
#10 |
Correcto
|
0.023 s | 3 KBi |
#11 |
Correcto
|
0.022 s | 3 KBi |
#12 |
Correcto
|
0.025 s | 3 KBi |
n = input() array = input() a = [int(x) for x in array.split()] n = int(n) flag = 0 for x in range(0, n - 1): if a[x] < a[x+1]: flag = 0 else: flag = 1 break if flag == 0: print('Ordenado') else: print('Desordenado')