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.*;

public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int max = Math.max(a,Math.max(b,c));
        int count = 0;
        int tmp;
        if(a != max){
            tmp = (max - a) / 2;
            count += tmp;
            a += tmp * 2;
        }
        if(b != max){
            tmp = (max - b) / 2;
            count += tmp;
            b += tmp * 2;
        }
        
        if(c != max){
            tmp = (max - c) / 2;
            count += tmp;
            c += tmp * 2;
        }
        switch(max * 3 - a - b - c){
            case 1:
                count += 2;
                break;
            case 2:
                count += 1;
                break;
            default:
                break;
        }
        System.out.println(count);
    }
}