Problem:
Score : 300 points

Problem Statement

2N players are running a competitive table tennis training on N tables numbered from 1 to N.

The training consists of rounds.
In each round, the players form N pairs, one pair per table.
In each pair, competitors play a match against each other.
As a result, one of them wins and the other one loses.

The winner of the match on table X plays on table X-1 in the next round,
except for the winner of the match on table 1 who stays at table 1.

Similarly, the loser of the match on table X plays on table X+1 in the next round,
except for the loser of the match on table N who stays at table N.

Two friends are playing their first round matches on distinct tables A and B.
Let's assume that the friends are strong enough to win or lose any match at will.
What is the smallest number of rounds after which the friends can get to play a match against each other?

Constraints

2 \leq N \leq 10^{18}

1 \leq A < B \leq N

All input values are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

Print the smallest number of rounds after which the friends can get to play a match against each other.

Sample Input 1

5 2 4

Sample Output 1

1

If the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.

Sample Input 2

5 2 3

Sample Output 2

2

If both friends win two matches in a row, they will both move to table 1.

Solution in C (GCC 5.4.1) (judge verdict: Runtime Error)

#include<stdio.h>

int saiki(int cnt,unsigned long A,unsigned long B);

unsigned long N;

int main()
{
  unsigned long A,B;
  scanf("%lu %lu %lu",&N,&A,&B);
  if(A==B){printf("0");return 0;}
  int cnt = saiki(0,A,B);
  printf("%d",cnt);
  return 0;
}

int saiki(int cnt,unsigned long A,unsigned long B)
{
	printf("%d %lu %lu\n",cnt,A,B);
	if(cnt >= N) return N;
  if(A==B)
  {
    return cnt;
  }
  unsigned long WA,WB,LA,LB;
  WA = A;
  WB = B;
  LA = A;
  LB = B;
  if(WA < N) WA++;
  if(WB < N) WB++;
  if(LA > 1) LA--;
  if(LB > 1) LB--;
  
  int kei[4] = {999999,999999,999999,999999};
  /* 
  	 両方勝 0 
  	 A勝B負 1
     A負B勝 2
     両方負 3
  */
  kei[0] = saiki(cnt+1,WA,WB);
  kei[1] = saiki(cnt+1,WA,LB);
  kei[2] = saiki(cnt+1,LA,WB);
  kei[3] = saiki(cnt+1,LA,LB);
  
  int mincnt = kei[0];
  for(int i=1;i<4;i++)
  {
    if(mincnt > kei[i])
      mincnt = kei[i];
  }
  return mincnt;
}