Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 9 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 0 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.002 s | 0 KBi |
#8 |
Correcto
|
0.004 s | 6 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.004 s | 2 KBi |
#11 |
Correcto
|
0.004 s | 8 KBi |
#12 |
Correcto
|
0.004 s | 3 KBi |
#13 |
Correcto
|
0.005 s | 1 KBi |
#14 |
Correcto
|
0.004 s | 1 KBi |
#15 |
Correcto
|
0.002 s | 0 KBi |
#16 |
Correcto
|
0.005 s | 43 KBi |
#17 |
Correcto
|
0.002 s | 0 KBi |
#18 |
Correcto
|
0.002 s | 0 KBi |
#19 |
Correcto
|
0.005 s | 17 KBi |
#20 |
Correcto
|
0.002 s | 0 KBi |
#21 |
Correcto
|
0.002 s | 0 KBi |
#22 |
Correcto
|
0.005 s | 5 KBi |
#23 |
Correcto
|
0.002 s | 0 KBi |
#24 |
Correcto
|
0.002 s | 0 KBi |
#25 |
Correcto
|
0.004 s | 55 KBi |
#26 |
Correcto
|
0.002 s | 0 KBi |
#27 |
Correcto
|
0.004 s | 1 KBi |
#28 |
Correcto
|
0.005 s | 1 KBi |
#29 |
Correcto
|
0.005 s | 2 KBi |
#30 |
Correcto
|
0.004 s | 7 KBi |
#31 |
Correcto
|
0.002 s | 0 KBi |
#32 |
Correcto
|
0.006 s | 1 KBi |
#33 |
Correcto
|
0.004 s | 2 KBi |
#34 |
Correcto
|
0.005 s | 1 KBi |
#35 |
Correcto
|
0.004 s | 1 KBi |
#36 |
Correcto
|
0.002 s | 0 KBi |
#include <bits/stdc++.h> using namespace std; int main() { int n, x, y; cin>>n>>x>>y; int pathToRight = y >= x ? y - x : y + (n - x); int pathToLeft = y >= x ? x + (n - y) : x - y; cout<<min(pathToRight, pathToLeft)<<endl; return 0; }