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 <iostream>
using namespace std;
int a, b, c;
int z[200];
int f[302][302][302];
int solve(int a, int b, int c) {
	if (a > 300 || b > 300 || c > 300) return 1000;
	if (f[a][b][c] != 1000) return f[a][b][c];
	int z[10];
	z[0] = solve(a + 1, b + 1, c); 
	z[1] = solve(a + 1, b, c + 1);
	z[2] = solve(a, b + 1, c + 1);
	z[3] = solve(a + 2, b, c);
	z[4] = solve(a, b + 2, c);
	z[5] = solve(a, b, c + 2);
	int mn = z[0];
	for (int j = 1; j <= 5; j++) mn = min(mn, z[j]);
	f[a][b][c] = mn + 1;
	return mn + 1;
}
int main() {
	// your code goes here
	for (int i = 0; i <= 300; i++)
	for (int j = 0; j <= 300; j++)
	for (int k = 0; k <= 300; k++) f[i][j][k] = 1000;
	for (int i = 0; i <= 300; i++) f[i][i][i] = 0;
	cin >> a >> b >> c;
	cout << solve(a, b, c);
	return 0;
}