Problem:
Score : 300 points

Problem Statement

Takahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:

Each person simultaneously divides his cookies in half and gives one half to each of the other two persons.

This action will be repeated until there is a person with odd number of cookies in hand.

How many times will they repeat this action?
Note that the answer may not be finite.

Constraints

1 ≤ A,B,C ≤ 10^9

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the number of times the action will be performed by the three people, if this number is finite.
If it is infinite, print -1 instead.

Sample Input 1

4 12 20

Sample Output 1

3

Initially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,

After the first action, they have 16, 12 and 8.

After the second action, they have 10, 12 and 14.

After the third action, they have 13, 12 and 11.

Now, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.

Sample Input 2

14 14 14

Sample Output 2

-1

Sample Input 3

454 414 444

Sample Output 3

1

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <cstdio>
#include <queue>
#include <algorithm>

using namespace std;

const int NMAX = 800;

char a[NMAX+5][NMAX+5];
bool vis[NMAX+5][NMAX+5];
queue <pair <int, int> > q;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};

inline int myabs(int x)
{
    return x > 0 ? x : -x;
}


int main()
{
    //freopen("test.in", "r", stdin);
    int n, m, k;
    scanf("%d%d%d", &n, &m, &k);
    for(int i=0; i<n; i++)
        scanf("%s", a[i]);
    pair <int, int> start;
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
            if(a[i][j] == 'S')
            {
                start = pair <int, int> (i, j);
                q.push(pair <int, int> (i, j));
                vis[i][j] = true;
            }
    int Min = (1LL<<31)-1;
    while(!q.empty())
    {
        pair <int, int> top = q.front();
        q.pop();
        Min = min(Min, top.first);
        Min = min(Min, top.second);
        Min = min(Min, n-1-top.first);
        Min = min(Min, m-1-top.second);
        for(int i=0; i<4; i++)
        {
            pair <int, int> New = pair <int, int> (top.first+dx[i], top.second+dy[i]);
            if(myabs(New.first - start.first) + myabs(New.second - start.second) <= k)
            if(New.first>=0 && New.second>=0 && New.first<n && New.second<m && vis[New.first][New.second]==0)
            if(a[New.first][New.second] == '.')
            {
                vis[New.first][New.second] = true;
                q.push(New);
            }
        }
    }
    if(Min == 0) printf("1\n");
    else printf("%d\n", 2+(Min-1)/k);
    return 0;
}