Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.024 s | 3 KBi |
#2 |
Incorrecto
|
0.02 s | 3 KBi |
#3 |
Incorrecto
|
0.025 s | 3 KBi |
#4 |
Incorrecto
|
0.023 s | 3 KBi |
#5 |
Incorrecto
|
0.02 s | 3 KBi |
#6 |
Incorrecto
|
0.02 s | 3 KBi |
#7 |
Incorrecto
|
0.02 s | 3 KBi |
#8 |
Incorrecto
|
0.025 s | 3 KBi |
#9 |
Incorrecto
|
0.021 s | 3 KBi |
#10 |
Incorrecto
|
0.021 s | 3 KBi |
#11 |
Incorrecto
|
0.021 s | 3 KBi |
#12 |
Incorrecto
|
0.023 s | 4 KBi |
#13 |
Incorrecto
|
0.024 s | 5 KBi |
#14 |
Incorrecto
|
0.025 s | 6 KBi |
#15 |
Incorrecto
|
0.02 s | 3 KBi |
#16 |
Incorrecto
|
0.022 s | 3 KBi |
#17 |
Incorrecto
|
0.019 s | 3 KBi |
#18 |
Incorrecto
|
0.024 s | 3 KBi |
#19 |
Incorrecto
|
0.026 s | 3 KBi |
#20 |
Incorrecto
|
0.019 s | 3 KBi |
#21 |
Incorrecto
|
0.021 s | 3 KBi |
#22 |
Incorrecto
|
0.022 s | 4 KBi |
#23 |
Incorrecto
|
0.03 s | 3 KBi |
#24 |
Incorrecto
|
0.021 s | 3 KBi |
#25 |
Incorrecto
|
0.02 s | 3 KBi |
#26 |
Incorrecto
|
0.023 s | 3 KBi |
#27 |
Incorrecto
|
0.023 s | 3 KBi |
#28 |
Incorrecto
|
0.023 s | 3 KBi |
#29 |
Incorrecto
|
0.02 s | 3 KBi |
#30 |
Incorrecto
|
0.019 s | 3 KBi |
#31 |
Incorrecto
|
0.021 s | 3 KBi |
#32 |
Incorrecto
|
0.024 s | 3 KBi |
#33 |
Incorrecto
|
0.026 s | 3 KBi |
#34 |
Incorrecto
|
0.025 s | 3 KBi |
def increment(s): res = [] c = 1 for d in reversed(s): c, nd = divmod(int(d) + c, 10) res.append(str(nd)) if c > 0: res.append(str(c)) return "".join(reversed(res))