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


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int>  P;
vector<vector<ll> >v;
const int maxn = 2e6;
ll val[maxn];
ll n,m;
int main() {
    int a[20];
    while(cin >> a[0] >> a[1] >> a[2]) {
        sort(a,a + 3);
        int cha1 = a[1] - a[0];
        int cha2 = a[2] - a[1];
        int num = 0;
        if(cha1 % 2) num = 1;
        int ans = cha2;
        if((a[2] - (cha2 + a[0]))% 2) ans += 2;
        ans += (a[2] - (cha2 + a[0])) / 2;
        cout <<  ans  << endl;
    }
    return 0;
}