Problem:
Score : 300 points

Problem Statement

You are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:

Choose two among A, B and C, then increase both by 1.

Choose one among A, B and C, then increase it by 2.

It can be proved that we can always make A, B and C all equal by repeatedly performing these operations.

Constraints

0 \leq A,B,C \leq 50

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the minimum number of operations required to make A, B and C all equal.

Sample Input 1

2 5 4

Sample Output 1

2

We can make A, B and C all equal by the following operations:

Increase A and C by 1. Now, A, B, C are 3, 5, 5, respectively.

Increase A by 2. Now, A, B, C are 5, 5, 5, respectively.

Sample Input 2

2 6 3

Sample Output 2

5

Sample Input 3

31 41 5

Sample Output 3

23

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include <string.h>
void BubbleSort(int a[], int N){
  int flag=1,i=0,j,tmp;
  while(flag==1){
    flag=0;
    for(j=N-1;j>i;j--){
      if(a[j]<a[j-1]){
	tmp=a[j];
	a[j]=a[j-1];
	a[j-1]=tmp;
	flag=1;
      }
    }
    i++;
  }
}
int main(){
  int N[3],s,t,i,M;
  scanf("%d %d %d",&N[0],&N[1],&N[2]);
  BubbleSort(N, 3);
  s=N[2]-N[1];
  t=N[2]-N[0];
  if(s%2==t%2){
    printf("%d",(s+t)/2);
  }else{
    printf("%d",(s+t+3)/2);
  }
}