Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.025 s | 3 KBi |
#2 |
Correcto
|
0.026 s | 3 KBi |
#3 |
Correcto
|
0.025 s | 3 KBi |
#4 |
Correcto
|
0.022 s | 3 KBi |
#5 |
Correcto
|
0.022 s | 3 KBi |
#6 |
Correcto
|
0.023 s | 3 KBi |
#7 |
Correcto
|
0.029 s | 4 KBi |
#8 |
Correcto
|
0.023 s | 3 KBi |
#9 |
Correcto
|
0.024 s | 3 KBi |
#10 |
Correcto
|
0.027 s | 5 KBi |
#11 |
Correcto
|
0.025 s | 3 KBi |
#12 |
Correcto
|
0.025 s | 3 KBi |
word = input() HT_LEN = 26 # minimal perfect hashing with ord() ht = [False] * HT_LEN repeated = 'yes' for char in word: idx = ord(char) - 97 # ord('a') == 97 if ht[idx]: break else: ht[idx] = True else: repeated = 'no' print(repeated)