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 C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>

int main(){
    int A[3];
    int tmp = 0;
    int max=0, sum=0;
    int ans;
    int i, j, k;

    for(i=0; i<3; i++){
        scanf("%d", &A[i]);
        if(A[i]%2 == 1){
            tmp++;
        }
        if(max<A[i]){
            max = A[i];
        }
    }

    for(i=0; i<3; i++){
        sum += max-A[i];
    }

    if(tmp==0){
        ans = sum/2;
    }else if(tmp==1){
        if(max%2==0){
            ans = sum/2 +2;
        }else{
            ans = sum/2;
        }
    }else if(tmp==2){
        if(max%2==0){
            ans = sum/2;
        }else{
            ans = sum/2 +2;
        }
    }else if(tmp==3){
        ans = sum/2;
    }

    printf("%d", ans);

    return 0;
}