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) {
		Scanner sc = new Scanner(System.in);
		int ans = 0;
		int a = sc.nextInt();
		int b = sc.nextInt();
		int c = sc.nextInt();
		int[] div = new int[2];
		div[0] = 0;
		div[1] = 0;
		div[a % 2]++;
		div[b % 2]++;
		div[c % 2]++;
		if((div[0] == 2) || (div[1] == 2))
			ans++;
		if(div[a % 2] == 2) {
			a++;
		}
		if(div[b % 2] == 2) {
			b++;
		}
		if(div[c % 2] == 2) {
			c++;
		}
		int tmp = Math.max(a, Math.max(b, c));
		ans += (tmp - a) / 2;
		ans += (tmp - b) / 2;
		ans += (tmp - c) / 2;
		System.out.println(ans);
	}

}