Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.02 s | 3 KBi |
#2 |
Correcto
|
0.021 s | 3 KBi |
#3 |
Correcto
|
0.026 s | 3 KBi |
#4 |
Correcto
|
0.032 s | 3 KBi |
#5 |
Correcto
|
0.021 s | 3 KBi |
#6 |
Correcto
|
0.025 s | 3 KBi |
#7 |
Correcto
|
0.02 s | 3 KBi |
#8 |
Correcto
|
0.022 s | 3 KBi |
#9 |
Correcto
|
0.022 s | 3 KBi |
#10 |
Correcto
|
0.024 s | 3 KBi |
#11 |
Correcto
|
0.025 s | 3 KBi |
#12 |
Correcto
|
0.022 s | 3 KBi |
#13 |
Correcto
|
0.025 s | 5 KBi |
#14 |
Correcto
|
0.025 s | 3 KBi |
#15 |
Correcto
|
0.031 s | 3 KBi |
#16 |
Correcto
|
0.021 s | 3 KBi |
#17 |
Correcto
|
0.022 s | 3 KBi |
#18 |
Correcto
|
0.026 s | 4 KBi |
#19 |
Correcto
|
0.021 s | 3 KBi |
#20 |
Correcto
|
0.021 s | 3 KBi |
#21 |
Correcto
|
0.021 s | 3 KBi |
#22 |
Correcto
|
0.025 s | 3 KBi |
#23 |
Correcto
|
0.022 s | 3 KBi |
#24 |
Correcto
|
0.028 s | 3 KBi |
#25 |
Correcto
|
0.02 s | 3 KBi |
#26 |
Correcto
|
0.031 s | 4 KBi |
#27 |
Correcto
|
0.035 s | 3 KBi |
#28 |
Correcto
|
0.024 s | 3 KBi |
#29 |
Correcto
|
0.021 s | 3 KBi |
#30 |
Correcto
|
0.021 s | 3 KBi |
#31 |
Correcto
|
0.031 s | 7 KBi |
#32 |
Correcto
|
0.031 s | 3 KBi |
#33 |
Correcto
|
0.026 s | 3 KBi |
#34 |
Correcto
|
0.035 s | 3 KBi |
def sum_one(string: str) -> str: number = [] i, adder = 0, 1 while adder and i < len(string): c, r = divmod(int(string[-i-1]) + adder, 10) number.append(str(r)) adder = c i += 1 if adder: number.append(str(adder)) return string[:-i] + "".join(number[::-1]) num = input() print(sum_one(num))