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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Linq;

public class Test
{
	public static void Main()
	{
		int max=0, count = 0;
		int[] a = new int[3];
		int[] b = new int[3];
		string[] s = Console.ReadLine().Split(' ');
		a[0] = int.Parse(s[0]);
		a[1] = int.Parse(s[1]);
		a[2] = int.Parse(s[2]);
		max = a.Max();
		
		for(int i=0;i<3;i++)
		{
			b[i] = max - a[i];
			count += b[i] / 2;
			b[i] = b[i] % 2;
			//Console.WriteLine(count+" "+b[i]);
		}
		switch(b.Sum())
		{
			case 1:
				Console.WriteLine(count+2);
				break;
			case 2:
				Console.WriteLine(count+1);
				break;
			default:
				Console.WriteLine(count);
				break;
		}
	}
}