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.*;
import java.io.*;
 
public class Main {
 
    public static void main(String[] args) throws IOException {
 
        Scanner sc = new Scanner(System.in);
 
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
 
        int maximumVal = 200;
        int padding = 9;
        int [][][] dp = new int[maximumVal + padding][maximumVal + padding][maximumVal + padding];
        for(int[][] array2d : dp){
            for(int[] array1d : array2d){
                Arrays.fill(array1d, Integer.MAX_VALUE / 2);
            }
        }
 
        dp[a][b][c] = 0;
        for(int i = 0; i <= maximumVal; i++){
            for(int j = 0; j <= maximumVal; j++){
                for(int k = 0; k <= maximumVal; k++){
                    if(i - 1 >= 0 && j - 1 >= 0){
                        dp[i][j][k] = Integer.min(dp[i][j][k], dp[i - 1][j - 1][k] + 1);
                    }
                    if(i - 1 >= 0 && k - 1 >= 0){
                        dp[i][j][k] = Integer.min(dp[i][j][k], dp[i - 1][j][k - 1] + 1);
                    }
                    if(j - 1 >= 0 && k - 1 >= 0){
                        dp[i][j][k] = Integer.min(dp[i][j][k], dp[i][j - 1][k - 1] + 1);
                    }
                    if(i - 2 >= 0){
                        dp[i][j][k] = Integer.min(dp[i][j][k], dp[i - 2][j][k] + 1);
                    }
                    if(j - 2 >= 0){
                        dp[i][j][k] = Integer.min(dp[i][j][k], dp[i][j - 2][k] + 1);
                    }
                    if(k - 2 >= 0){
                        dp[i][j][k] = Integer.min(dp[i][j][k], dp[i][j][k - 2] + 1);
                    }
                }
            }
        }
 
        int ans = Integer.MAX_VALUE;
        for(int i = 0; i <= maximumVal; i++){
            ans = Integer.min(ans, dp[i][i][i]);
        }
 
        System.out.println(ans);
 
    }
}