Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.022 s | 3 KBi |
#2 |
Correcto
|
0.02 s | 3 KBi |
#3 |
Correcto
|
0.028 s | 3 KBi |
#4 |
Incorrecto
|
0.025 s | 3 KBi |
#5 |
Correcto
|
0.025 s | 3 KBi |
#6 |
Correcto
|
0.022 s | 3 KBi |
#7 |
Correcto
|
0.022 s | 3 KBi |
#8 |
Correcto
|
0.025 s | 3 KBi |
#9 |
Correcto
|
0.024 s | 7 KBi |
#10 |
Correcto
|
0.027 s | 3 KBi |
#11 |
Incorrecto
|
0.029 s | 3 KBi |
#12 |
Correcto
|
0.03 s | 4 KBi |
#13 |
Incorrecto
|
0.026 s | 3 KBi |
#14 |
Incorrecto
|
0.023 s | 3 KBi |
#15 |
Incorrecto
|
0.021 s | 3 KBi |
#16 |
Incorrecto
|
0.026 s | 6 KBi |
#17 |
Incorrecto
|
0.024 s | 3 KBi |
#18 |
Incorrecto
|
0.023 s | 3 KBi |
#19 |
Incorrecto
|
0.024 s | 3 KBi |
#20 |
Incorrecto
|
0.021 s | 3 KBi |
#21 |
Correcto
|
0.022 s | 3 KBi |
#22 |
Correcto
|
0.027 s | 3 KBi |
#23 |
Correcto
|
0.029 s | 3 KBi |
#24 |
Correcto
|
0.02 s | 3 KBi |
#25 |
Correcto
|
0.042 s | 7 KBi |
#26 |
Correcto
|
0.028 s | 3 KBi |
#27 |
Correcto
|
0.02 s | 3 KBi |
#28 |
Correcto
|
0.02 s | 3 KBi |
#29 |
Correcto
|
0.029 s | 3 KBi |
#30 |
Correcto
|
0.021 s | 3 KBi |
#31 |
Correcto
|
0.021 s | 3 KBi |
#32 |
Correcto
|
0.028 s | 3 KBi |
#33 |
Correcto
|
0.029 s | 3 KBi |
#34 |
Correcto
|
0.02 s | 3 KBi |
#35 |
Correcto
|
0.023 s | 4 KBi |
#36 |
Correcto
|
0.045 s | 4 KBi |
#37 |
Correcto
|
0.034 s | 4 KBi |
#38 |
Correcto
|
0.038 s | 4 KBi |
#39 |
Correcto
|
0.029 s | 4 KBi |
#40 |
Correcto
|
0.034 s | 3 KBi |
#41 |
Correcto
|
0.031 s | 3 KBi |
#42 |
Correcto
|
0.037 s | 3 KBi |
n = [int(x) for x in input()] k = int(input()) limit = -len(n) index = -1 while index >= limit: n[index] += k k = 1 if n[index] < 10: break n[index] = n[index] - 10 n[index] = str(n[index]) index -= 1 while index >= limit: n[index] = str(n[index]) index -= 1 if n[limit] == "0": n.insert(0, "1") print("".join(n))