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: Wrong Answer)

using System;
class Program
{
	static void Main()
	{
	int[] nums = Array.ConvertAll(Console.ReadLine().Split(' '),int.Parse);
	int answer = 0;
    int[] numDivides = new int[3];
      
      for(int i = 0; i < 3; i++) numDivides[i]=nums[i]%2;
      
      if(numDivides[0]!=numDivides[1] && numDivides[0]!=numDivides[2])
      {
        nums[1]++;
        nums[2]++;
        answer++;
      }
       if(numDivides[1]!=numDivides[0] && numDivides[1]!=numDivides[2])
      {
        nums[0]++;
        nums[2]++;
        answer++;
      }
       if(numDivides[2]!=numDivides[1] && numDivides[2]!=numDivides[0])
      {
        nums[0]++;
        nums[1]++;
        answer++;
      }
      Array.Sort(nums);
      answer+=nums[2]-nums[1];
      answer+=nums[1]-nums[0];  
      
	Console.WriteLine(answer);//WriteLineをWriteとすると、改行なしで出力。
	}
}