Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.021 s | 3 KBi |
#2 |
Incorrecto
|
0.022 s | 3 KBi |
#3 |
Incorrecto
|
0.024 s | 3 KBi |
#4 |
Incorrecto
|
0.028 s | 4 KBi |
#5 |
Incorrecto
|
0.02 s | 3 KBi |
#6 |
Incorrecto
|
0.021 s | 3 KBi |
#7 |
Incorrecto
|
0.022 s | 3 KBi |
#8 |
Incorrecto
|
0.027 s | 3 KBi |
#9 |
Incorrecto
|
0.02 s | 3 KBi |
#10 |
Incorrecto
|
0.022 s | 3 KBi |
#11 |
Incorrecto
|
0.02 s | 3 KBi |
#12 |
Incorrecto
|
0.022 s | 3 KBi |
lista = [int(x) for x in input().split()] def order(lista): for n in range(len(lista)-1): if lista[n] < lista[n+1]: continue else: return "Desordenado" return "Ordenado" order(lista)