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 Scala (2.11.7) (judge verdict: Accepted)

object Main extends App {
  val Array(a,b,c) = readLine.split(" ").map{_.toInt}
  
  if ((a+b)%2==0&&(b+c)%2==0&&(c+a)%2==0) {
    val Array(aa,bb,cc) = Array(a,b,c).sorted
    println((2*cc-aa-bb)/2)
  } else {
    val even = Array(a,b,c).filter{_%2==0}
    val odd = Array(a,b,c).filter{_%2==1}
    if (even.size==1) {
      val aa = even(0)
      val bb = odd(0)+1
      val cc = odd(1)+1
      val Array(aaa,bbb,ccc) = Array(aa,bb,cc).sorted
      println(1+(2*ccc-aaa-bbb)/2)
    } else {
      val aa = even(0) + 1
      val bb = even(1) + 1
      val cc = odd(0)
      val Array(aaa,bbb,ccc) = Array(aa,bb,cc).sorted
      println(1+(2*ccc-aaa-bbb)/2)
    }
  }
}