Envío 4170
Problema 0x32 - Sumar dos números muy grandes
- Autor: Serivt
- Fecha: 2021-05-24 18:37:36 UTC (Hace casi 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.042 s | 3 KBi |
| #2 |
Incorrecto
|
0.026 s | 3 KBi |
| #3 |
Correcto
|
0.027 s | 3 KBi |
| #4 |
Correcto
|
0.047 s | 4 KBi |
| #5 |
Correcto
|
0.053 s | 6 KBi |
| #6 |
Correcto
|
0.026 s | 3 KBi |
| #7 |
Correcto
|
0.021 s | 3 KBi |
| #8 |
Correcto
|
0.021 s | 3 KBi |
| #9 |
Correcto
|
0.024 s | 3 KBi |
| #10 |
Correcto
|
0.023 s | 3 KBi |
| #11 |
Correcto
|
0.021 s | 4 KBi |
| #12 |
Correcto
|
0.028 s | 3 KBi |
| #13 |
Correcto
|
0.027 s | 3 KBi |
| #14 |
Incorrecto
|
0.021 s | 3 KBi |
| #15 |
Correcto
|
0.024 s | 3 KBi |
| #16 |
Correcto
|
0.038 s | 3 KBi |
| #17 |
Correcto
|
0.025 s | 7 KBi |
| #18 |
Correcto
|
0.026 s | 3 KBi |
| #19 |
Incorrecto
|
0.026 s | 3 KBi |
| #20 |
Incorrecto
|
0.03 s | 3 KBi |
| #21 |
Correcto
|
0.022 s | 3 KBi |
| #22 |
Incorrecto
|
0.031 s | 3 KBi |
| #23 |
Correcto
|
0.02 s | 3 KBi |
| #24 |
Correcto
|
0.022 s | 3 KBi |
| #25 |
Incorrecto
|
0.021 s | 3 KBi |
| #26 |
Correcto
|
0.027 s | 3 KBi |
| #27 |
Incorrecto
|
0.027 s | 3 KBi |
| #28 |
Incorrecto
|
0.022 s | 3 KBi |
| #29 |
Correcto
|
0.031 s | 3 KBi |
| #30 |
Correcto
|
0.035 s | 7 KBi |
| #31 |
Correcto
|
0.04 s | 4 KBi |
| #32 |
Correcto
|
0.033 s | 4 KBi |
| #33 |
Correcto
|
0.055 s | 4 KBi |
| #34 |
Correcto
|
0.033 s | 4 KBi |
| #35 |
Correcto
|
0.049 s | 4 KBi |
| #36 |
Correcto
|
0.033 s | 4 KBi |
| #37 |
Correcto
|
0.031 s | 4 KBi |
| #38 |
Correcto
|
0.034 s | 3 KBi |
Puntos totales: 79 / 100
Código
x = [int(i) for i in input()]
y = [int(i) for i in input()]
x.reverse()
if len(x) < len(y):
x, y = y, x
k = 0
for i in range(0, len(x)):
if y:
k += y.pop()
v = x[i] + k
x[i] = str(v % 10)
k = v // 10
x.reverse()
if k > 0:
x.insert(0, "1")
print("".join(x))