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: Runtime Error)

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <map>
#define ull unsigned long long
#define ll long long
using namespace std;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<int> q;
    for(int i=0;i<3;i++){
        int x;
        cin >> x;
        q.push_back(x);
    }
    sort(q.begin(),q.end());
            q[0]+=q[0]*(q[1]/q[0]);
    int ans=(q[1]/q[0])-q[0];
    while(1){
        int p=max(max(q[0],q[1]),max(q[1],q[2]));
        // q[0]+=2;
        // ans++;
        for(int i=0;i<3;i++){
            q[0]++;
            q[1]++;
            ans++;
            sort(q.begin(),q.end());
            if(q[1]==q[2] && q[0]+2==q[1]){
                cout << ans+1 << endl;
                return 0;
            }
            else if(q[0]==q[1] && q[1]==q[2]){
                cout << ans << endl;
                return 0;
            }
        }
        sort(q.begin(),q.end());
        if(q[1]==q[2] && q[0]+2==q[1]){
            cout << ans+1 << endl;
            return 0;
        }
    }
    return 0;
}