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,b,c,tm,tm2,count=0;
    int i,j;
    int ar[3];
    scanf("%d%d%d",&a,&b,&c);
    ar[0]=a;
    ar[1]=b;
    ar[2]=c;
    for(i=0; i<2; i++)
    {
        for(j=0; j<2; j++){
                if(ar[i]<ar[j+1]){
                tm=ar[j+1];
                ar[j+1]=ar[i];
                ar[i]=tm;
            }
        }
    }
    a=ar[0];
    b=ar[1];
    c=ar[2];
    for(i=b; i<a; i++)
    {
        b++;
        c++;
        count++;
    }
    if(a==b)
    {
        for(i=c; i<a; i+=2){
            c+=2;
            count++;
        }
        if(a==b && a==c-1)
        {
            a++;b++;
            count++;
        }

    }
    printf("%d\n",count);
    return 0;
}