Envío 5809
Problema 0xe2 - Detectar overflow al sumar dos enteros de 64 bits
- Autor: Franchesco
- Fecha: 2022-03-03 18:10:44 UTC (Hace casi 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.027 s | 3 KBi |
| #2 |
Correcto
|
0.01 s | 3 KBi |
| #3 |
Correcto
|
0.016 s | 3 KBi |
| #4 |
Correcto
|
0.011 s | 3 KBi |
| #5 |
Correcto
|
0.027 s | 3 KBi |
| #6 |
Correcto
|
0.025 s | 3 KBi |
| #7 |
Correcto
|
0.01 s | 3 KBi |
| #8 |
Correcto
|
0.026 s | 7 KBi |
| #9 |
Correcto
|
0.011 s | 2 KBi |
| #10 |
Correcto
|
0.009 s | 3 KBi |
| #11 |
Correcto
|
0.01 s | 3 KBi |
| #12 |
Correcto
|
0.011 s | 3 KBi |
| #13 |
Correcto
|
0.012 s | 3 KBi |
| #14 |
Correcto
|
0.009 s | 3 KBi |
| #15 |
Correcto
|
0.025 s | 3 KBi |
| #16 |
Correcto
|
0.028 s | 3 KBi |
| #17 |
Correcto
|
0.011 s | 3 KBi |
| #18 |
Correcto
|
0.01 s | 3 KBi |
| #19 |
Correcto
|
0.01 s | 3 KBi |
| #20 |
Correcto
|
0.023 s | 3 KBi |
| #21 |
Correcto
|
0.024 s | 2 KBi |
| #22 |
Correcto
|
0.022 s | 6 KBi |
| #23 |
Correcto
|
0.011 s | 3 KBi |
| #24 |
Correcto
|
0.028 s | 3 KBi |
| #25 |
Correcto
|
0.012 s | 3 KBi |
| #26 |
Correcto
|
0.027 s | 2 KBi |
| #27 |
Correcto
|
0.026 s | 3 KBi |
| #28 |
Correcto
|
0.012 s | 3 KBi |
| #29 |
Correcto
|
0.028 s | 3 KBi |
Puntos totales: 100 / 100
Código
num_one = int(input())
num_two = int(input())
max_value = 2**64
if max_value - num_one > num_two:
print('Safe')
else:
print('Overflow')