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.Collections.Generic;
using System.Linq;
using System.Text;

public class MainClass
{
	public const long Giri = 1000000007;

	
	public static void Main(string[] args)
	{
		int[] p = Input().ToInt();
		
		int sousa = 0;
		int dif = 0;
		for(int i = 0; i < p.Length; i++)
		{
			if(p[i] % 2 != 0)
			{
				dif++;
			}
		}
		if(dif == 1)
		{
			for(int i = 0; i < p.Length; i++)
				if(p[i] % 2 == 0) p[i]++;
			sousa++;
		}
		if(dif == 2)
		{
			for(int i = 0; i < p.Length; i++)
				if(p[i] % 2 == 1) p[i]++;
			sousa++;
		}
		int max = (int)Math.Max(p[0], Math.Max(p[1], p[2]));
		
			
		sousa += (max - p[0]) / 2;
		sousa += (max - p[1]) / 2;
		sousa += (max - p[2]) / 2;
		Console.WriteLine(sousa);
	}
	
	public static long GCD(long a, long b)
	{
		if(b == 1)
			return a;
		long p = b / a;
		return GCD(a, b - a*p);
	}
	
	public static string[] Input() { return Console.ReadLine().Split(' '); }
	public static int Clamp(int val, int max, int min = 0) { return Math.Min(max, Math.Max(min, val)); }
}

public static class Smarter
{
	public static int ToInt(this string str) { return int.Parse(str); }
	public static long ToLong(this string str) { return long.Parse(str); }
	public static int[] ToInt(this string[] str)
	{
		int[] r = new int[str.Length];
		for(int i = 0; i < str.Length; i++)
			r[i]=str[i].ToInt();
		return r;
	 }
	
}