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# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;

namespace AtCoder
{
	public class ABC
	{
		static public void Main(string[] args)
		{
			Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
			Solve();
			Console.Out.Flush();
		}

		const int mod = 1000000007;  // 10^9+7
		static int Mod(long x, int m) { return (int)((x % m + m) % m); }
		static long Mod(long x, long m) { return (x % m + m) % m; }

		static public void Solve()
		{
			//string s = Console.ReadLine();
			//int n = int.Parse(Console.ReadLine());
			//long x = long.Parse(Console.ReadLine());
			//int[] vs = Console.ReadLine().Split().Select(int.Parse).ToArray();
			//long[] vs = Console.ReadLine().Split().Select(long.Parse).ToArray();

			int[] a = Console.ReadLine().Split().Select(int.Parse).OrderBy(p=>p).ToArray();
			int ans = 0;
			if (a[0] < a[2]) {
				int i = (a[2] - a[0]) / 2;
				a[0] += i * 2;
				ans += i;
			}
			//System.Diagnostics.Debug.WriteLine($"{ans}:{string.Join(" ", a)}");
			if (a[1] < a[2]) {
				int i = (a[2] - a[1]) / 2;
				a[1] += i * 2;
				ans += i;
			}
			//System.Diagnostics.Debug.WriteLine($"{ans}:{string.Join(" ", a)}");
			if (a[0] == a[1] && a[0] != a[2]) {
				ans++;
			} else if (a[0] == a[2] && a[0] != a[1]) {
				ans += 2;
			} else if (a[1] == a[2] && a[1] != a[0]) {
				ans += 2;
			}
			Console.WriteLine(ans);

		}
	}
}