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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc1 = new Scanner(System.in);

		int[] num = new int[3];
		num[0] = sc1.nextInt();
		num[1] = sc1.nextInt();
		num[2] = sc1.nextInt();
		int ans = 0;

		num = sort(num);

		while (num[0] != num[1] || num[1] != num[2] ) {

			if (num[2] >= num[0] + 2) {
				num[0] += 2;
			}
			else {
				num [0] += 1;
				num [1] += 1;
			}
			ans++;
			num = sort(num);
			//System.out.println(num[0] + " " + num[1] + " " + num[2]);
		}

		System.out.println(ans);

		sc1.close();
	}

	static int[] sort(int[] num) {

		for (int i =0 ; i < 2 ; i++ ) {
			for (int index = 0; index < 2 ; index ++) {
				if (num[index] > num[index + 1]) {
					int a = num[index];
					int b = num[index+1];
					num[index] = b;
					num[index+1] = a;
				}
			}
		}

		return num;
	}

}