Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.033 s | 3 KBi |
#2 |
Correcto
|
0.019 s | 3 KBi |
#3 |
Correcto
|
0.03 s | 3 KBi |
#4 |
Correcto
|
0.025 s | 3 KBi |
#5 |
Correcto
|
0.027 s | 3 KBi |
#6 |
Correcto
|
0.026 s | 3 KBi |
#7 |
Correcto
|
0.072 s | 3 KBi |
#8 |
Correcto
|
0.059 s | 3 KBi |
#9 |
Correcto
|
0.069 s | 3 KBi |
#10 |
Correcto
|
0.075 s | 3 KBi |
#11 |
Correcto
|
0.134 s | 8 KBi |
#12 |
Correcto
|
0.069 s | 3 KBi |
#13 |
Incorrecto
|
0.074 s | 3 KBi |
#14 |
Correcto
|
0.081 s | 3 KBi |
#15 |
Correcto
|
0.066 s | 3 KBi |
#16 |
Correcto
|
0.09 s | 3 KBi |
#17 |
Correcto
|
0.062 s | 3 KBi |
#18 |
Correcto
|
0.025 s | 3 KBi |
#19 |
Correcto
|
0.058 s | 3 KBi |
#20 |
Correcto
|
0.026 s | 3 KBi |
#21 |
Correcto
|
0.022 s | 3 KBi |
#22 |
Correcto
|
0.029 s | 3 KBi |
def string_edge(s): left = 0 right = 1 while True: right = s.find(s[left], right) if right == -1: break while True: left += 1 right += 1 if right == len(s): return left if s[left] != s[right]: left = 0 break return left s = input() print(string_edge(s))