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.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String[] tokens = in.nextLine().split(" ");
		List<Integer> values = new ArrayList<>();
		for (String token : tokens) {
			values.add(Integer.parseInt(token));
		}
		Collections.sort(values);
		int result = 0;
		while (true) {
			int r = operation(values);
			if (r == 0) {
				break;
			}
			result += r;
			Collections.sort(values);
		}
		System.out.println(result);
		in.close();
	}

	public static int operation(List<Integer> values) {
		if (values.get(0) == values.get(2)) {
			return 0;
		}
		if (values.get(0) == values.get(1)) {
			int result = values.get(2)-values.get(1);
			values.set(0, values.get(2));
			values.set(1, values.get(2));
			return result;
		}
		if ((values.get(1) - values.get(0)) % 2 == 0) {
			int result = (values.get(1) - values.get(0)) / 2;
			values.set(0, values.get(1));
			return result;
		} else {
			int result = (values.get(1) + 1 - values.get(0)) / 2;
			values.set(0, values.get(1));
			values.set(1, values.get(1) + 1);
			return result;
		}
	}
}