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<math.h>

int main(){
  int a,b,c;
  scanf("%d%d%d",&a,&b,&c);

  int max3=fmax(a,fmax(b,c));
  int min3=fmin(a,fmin(b,c));
  int mid3=a+b+c-max3-min3;

  int dmid=max3-mid3;
  int num=dmid;

  if((max3-(min3+dmid)) %2 == 0){
    num=num+((max3-(min3+dmid))/2);
  }
  else{
    num=num+((max3-(min3+dmid))/2)+2;
  }
  printf("%d\n",num);
  return 0;
}