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>

int main(void)
{
int a, b, c;
int ct;
scanf("%d %d %d", &a, &b, &c);
int max;
max=(b>c)?(a>b)?a:b:(a>c)?a:c;
a = max - a;
b = max - b;
c = max - c;
int d, e;
if(a==0){
	d = b;
	e = c;
}else if(b==0){
	d = a;
	e = c;
}else{
	d = a;
	e = b;
}
int min;
if((d%2==0 && e%2==0) || (d%2 && e%2)){
	min = (d>e)?e:d;
	max = (d>e)?d:e;
	ct = min + ((max-min)/2);
}else{
	min = (d>e)?e:d;
	max = (d>e)?d:e;
	ct = min + ((max-min)/2) + 2;
}
printf("%d\n", ct);
return 0;
}