Envío 4939
Problema 0xd6 - Camino más corto de la Tortuga en un arreglo circular
- Autor: bryancalisto
- Fecha: 2021-09-22 00:17:20 UTC (Hace alrededor de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.027 s | 3 KBi |
| #2 |
Correcto
|
0.051 s | 3 KBi |
| #3 |
Correcto
|
0.05 s | 3 KBi |
| #4 |
Correcto
|
0.069 s | 3 KBi |
| #5 |
Correcto
|
0.048 s | 3 KBi |
| #6 |
Correcto
|
0.021 s | 3 KBi |
| #7 |
Correcto
|
0.042 s | 3 KBi |
| #8 |
Correcto
|
0.022 s | 3 KBi |
| #9 |
Correcto
|
0.024 s | 3 KBi |
| #10 |
Correcto
|
0.072 s | 3 KBi |
| #11 |
Correcto
|
0.021 s | 3 KBi |
| #12 |
Correcto
|
0.022 s | 3 KBi |
| #13 |
Correcto
|
0.024 s | 3 KBi |
| #14 |
Correcto
|
0.023 s | 3 KBi |
| #15 |
Correcto
|
0.019 s | 3 KBi |
| #16 |
Correcto
|
0.023 s | 3 KBi |
| #17 |
Correcto
|
0.037 s | 3 KBi |
| #18 |
Correcto
|
0.027 s | 3 KBi |
| #19 |
Correcto
|
0.023 s | 3 KBi |
| #20 |
Correcto
|
0.023 s | 3 KBi |
| #21 |
Correcto
|
0.023 s | 3 KBi |
| #22 |
Correcto
|
0.051 s | 3 KBi |
| #23 |
Correcto
|
0.025 s | 3 KBi |
| #24 |
Correcto
|
0.025 s | 3 KBi |
| #25 |
Correcto
|
0.02 s | 3 KBi |
| #26 |
Correcto
|
0.018 s | 3 KBi |
| #27 |
Correcto
|
0.027 s | 7 KBi |
| #28 |
Correcto
|
0.02 s | 3 KBi |
| #29 |
Correcto
|
0.02 s | 3 KBi |
| #30 |
Correcto
|
0.021 s | 3 KBi |
| #31 |
Correcto
|
0.016 s | 3 KBi |
| #32 |
Correcto
|
0.021 s | 3 KBi |
| #33 |
Correcto
|
0.045 s | 3 KBi |
| #34 |
Correcto
|
0.019 s | 3 KBi |
| #35 |
Correcto
|
0.019 s | 3 KBi |
| #36 |
Correcto
|
0.019 s | 3 KBi |
Puntos totales: 100 / 100
Código
N, X, Y = list(map(lambda x: int(x), input().split(' ')))
print(min((Y-X) % N, (N-Y+X) % N))