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 Java7 (OpenJDK 1.7.0) (judge verdict: Accepted)

import java.io.*;
import java.util.*;
 
public class Main {
    public static void main(String[] args) throws Exception {
        // Your code here!
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] str_nums = br.readLine().split(" ");
        int[] nums = new int[3];
        nums[0] = Integer.parseInt(str_nums[0]);
        nums[1] = Integer.parseInt(str_nums[1]);
        nums[2] = Integer.parseInt(str_nums[2]);
        int count = 0;
        
        while (!(nums[0] == nums[1] && nums[1] == nums[2])) {
            Arrays.sort(nums);
            if ((nums[0] == nums[1] || nums[1] == nums[2] || nums[2] == nums[0]) && (!(nums[0] == nums[1] && nums[1] == nums[2]))) {
                if (nums[2] > nums[1]) {
                    nums[0] += 1;
                    nums[1] += 1;
                    count++;
                }
                else {
                    nums[0] += 2;
                    count++;
                }
            }
            else {
                nums[0] += 1;
                nums[1] += 1;
                count++;
            }
        }
        System.out.println(count);
    }
}