Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.106 s | 13 KBi |
#2 |
Correcto
|
0.115 s | 14 KBi |
#3 |
Correcto
|
0.084 s | 16 KBi |
#4 |
Correcto
|
0.065 s | 16 KBi |
#5 |
Correcto
|
0.093 s | 13 KBi |
#6 |
Correcto
|
0.081 s | 16 KBi |
#7 |
Correcto
|
0.123 s | 13 KBi |
#8 |
Correcto
|
0.127 s | 13 KBi |
#9 |
Correcto
|
0.146 s | 13 KBi |
#10 |
Correcto
|
0.074 s | 16 KBi |
#11 |
Correcto
|
0.116 s | 13 KBi |
#12 |
Correcto
|
0.071 s | 16 KBi |
#13 |
Correcto
|
0.068 s | 17 KBi |
#14 |
Correcto
|
0.107 s | 14 KBi |
#15 |
Correcto
|
0.111 s | 13 KBi |
#16 |
Correcto
|
0.1 s | 13 KBi |
#17 |
Correcto
|
0.14 s | 13 KBi |
#18 |
Correcto
|
0.089 s | 13 KBi |
#19 |
Correcto
|
0.517 s | 13 KBi |
#20 |
Correcto
|
0.584 s | 13 KBi |
#21 |
Correcto
|
0.114 s | 22 KBi |
#22 |
Correcto
|
0.513 s | 13 KBi |
#23 |
Correcto
|
0.803 s | 13 KBi |
#24 |
Correcto
|
0.354 s | 15 KBi |
#25 |
Correcto
|
0.289 s | 16 KBi |
#26 |
Correcto
|
0.567 s | 13 KBi |
#27 |
Correcto
|
0.242 s | 16 KBi |
#28 |
Correcto
|
0.514 s | 13 KBi |
#29 |
Correcto
|
0.234 s | 13 KBi |
#30 |
Correcto
|
0.231 s | 13 KBi |
#31 |
Correcto
|
0.282 s | 13 KBi |
#32 |
Correcto
|
0.171 s | 16 KBi |
#33 |
Correcto
|
0.393 s | 14 KBi |
#34 |
Correcto
|
0.343 s | 16 KBi |
#35 |
Correcto
|
0.263 s | 16 KBi |
#36 |
Correcto
|
0.234 s | 13 KBi |
import java.util.Scanner; class Main { public static void main(String[] args){ Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int x = sc.nextInt(); int y = sc.nextInt(); int rigth = 0; int left = 0; for(int i = x; i < n; i++){ rigth++; if(i == y){ break; } if(i == n-1){ i = -1; } } for(int i = x; i < n; i--){ left++; if(i == y){ break; } if(i == 0){ i = n; } } System.out.print(rigth > left ? left-1 : rigth-1); } }