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 static Atcoder;
using System.Threading.Tasks;
using System.ComponentModel;

public class Hello
{

    public static void Main()
    {
        int[] n = SpRead(' ').Select(a => int.Parse(a)).ToArray();
        int count = 0;
        while (true)
        {
            if (n[0] == n[1] && n[1] == n[2]) break;
            count++;
            int Max = n.Max();
            int Min = n.Min();
            if (Max - Min == 1)
            {
                if (Max == n[0])
                {
                    if (n[1] == n[2]) { n[1] += 1; n[2] += 1; }
                    else
                    {
                        if (Min == n[1]) n[1] += 2;
                        else if (Min == n[2]) n[2] += 2;
                    }
                }
                else if (Max == n[1])
                {
                    if (n[0] == n[2]) { n[0] += 1; n[2] += 1; }
                    else
                    {
                        if (Min == n[0]) n[0] += 2;
                        else if (Min == n[2]) n[2] += 2;
                    }
                }
                else if (Max == n[2])
                {
                    if (n[1] == n[0]) { n[1] += 1; n[0] += 1; }
                    else
                    {
                        if (Min == n[1]) n[1] += 2;
                        else if (Min == n[0]) n[0] += 2;
                    }
                }
            }
            else
            {
                if (Min == n[0]) n[0] += 2;
                else if (Min == n[1]) n[1] += 2;
                else if (Min == n[2]) n[2] += 2;
            }
            //Console.WriteLine(n[0] + " " + n[1] + " " + n[2]);
        }
        Console.WriteLine(count);
    }

}


public class Atcoder
{
    static void Swap<T>(ref T a, ref T b)
    {
        var t = a;
        a = b;
        b = t;
    }
    public static int LCM(int a, int b)
    {
        int c = a * b;
        if (a < b) Swap(ref a, ref b);
        int d = a % b;
        while (d != 0)
        {
            a = b;
            b = d;
            d = a % b;
        }
        return c / b;
    }
    public static string strReverce(string s)
    {
        return new string(s.Reverse().ToArray());
    }
    public static int Cin()
    {
        return int.Parse(Console.ReadLine());
    }
    public static bool IsPrime(int n)
    {
        if (n < 2) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;

        //double sqrtNum = Math.Sqrt(n);
        for (int i = 3; i < n; i += 2)
        {
            if (n % i == 0) return false;
        }
        return true;
    }
    public static string[] SpRead(char c)
    {
        return Console.ReadLine().Split(c);
    }
}