Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.16 s | 13 KBi |
#2 |
Correcto
|
0.134 s | 13 KBi |
#3 |
Correcto
|
0.134 s | 13 KBi |
#4 |
Correcto
|
0.097 s | 13 KBi |
#5 |
Correcto
|
0.115 s | 13 KBi |
#6 |
Correcto
|
0.098 s | 13 KBi |
#7 |
Correcto
|
0.125 s | 13 KBi |
#8 |
Correcto
|
0.115 s | 15 KBi |
#9 |
Correcto
|
0.136 s | 13 KBi |
#10 |
Correcto
|
0.114 s | 13 KBi |
#11 |
Correcto
|
0.11 s | 17 KBi |
#12 |
Correcto
|
0.13 s | 13 KBi |
#13 |
Correcto
|
0.114 s | 15 KBi |
#14 |
Correcto
|
0.107 s | 13 KBi |
#15 |
Correcto
|
0.172 s | 13 KBi |
#16 |
Correcto
|
0.115 s | 13 KBi |
#17 |
Correcto
|
0.106 s | 13 KBi |
#18 |
Correcto
|
0.11 s | 15 KBi |
#19 |
Correcto
|
0.486 s | 13 KBi |
#20 |
Correcto
|
0.345 s | 13 KBi |
#21 |
Correcto
|
0.149 s | 13 KBi |
#22 |
Correcto
|
0.482 s | 13 KBi |
#23 |
Correcto
|
0.497 s | 17 KBi |
#24 |
Correcto
|
0.267 s | 13 KBi |
#25 |
Correcto
|
0.41 s | 16 KBi |
#26 |
Correcto
|
0.401 s | 13 KBi |
#27 |
Correcto
|
0.295 s | 13 KBi |
#28 |
Correcto
|
0.474 s | 17 KBi |
#29 |
Correcto
|
0.312 s | 13 KBi |
#30 |
Correcto
|
0.217 s | 13 KBi |
#31 |
Correcto
|
0.382 s | 13 KBi |
#32 |
Correcto
|
0.341 s | 13 KBi |
#33 |
Correcto
|
0.379 s | 14 KBi |
#34 |
Correcto
|
0.59 s | 15 KBi |
#35 |
Correcto
|
0.325 s | 13 KBi |
#36 |
Correcto
|
0.284 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 contadord = -1; int contadori = -1; if(n == 1){ System.out.print(0); System.exit(0); } for(int i = x; i < n; i++){ contadord++; if(i == y){ break; } if(i == n-1){ i=-1; } } for(int j = x; j >= 0; j--){ contadori++; if(j == y){ break; } if(j == 0){ j=n; } } if(contadord < contadori){ System.out.print(contadord); }else{ System.out.print(contadori); } } }