Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.023 s | 3 KBi |
#2 |
Incorrecto
|
0.023 s | 3 KBi |
#3 |
Incorrecto
|
0.024 s | 3 KBi |
#4 |
Incorrecto
|
0.032 s | 3 KBi |
#5 |
Incorrecto
|
0.02 s | 3 KBi |
#6 |
Incorrecto
|
0.026 s | 3 KBi |
#7 |
Incorrecto
|
0.028 s | 3 KBi |
#8 |
Incorrecto
|
0.027 s | 3 KBi |
#9 |
Incorrecto
|
0.023 s | 3 KBi |
#10 |
Incorrecto
|
0.025 s | 3 KBi |
#11 |
Incorrecto
|
0.019 s | 3 KBi |
#12 |
Incorrecto
|
0.021 s | 3 KBi |
def has_repeated_letter(word): alphabet = [0] * 26 for letter in word: letter_number = ord(letter) - 97 if alphabet[letter_number] > 0: return False alphabet[letter_number] += 1 return True word = input() if has_repeated_letter(word): print("yes") else: print("no")