Submission #2238923

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);i++)
#define erep(i,a,b) for(int i=a;i<=(int)(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>(a);i--)
#define eper(i,a,b) for(int i=((int)(a));i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (1<<30)-1
#define MOD 1000000007
using namespace std;
typedef long long ll;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

ll a[3];
ll ans = 0;
int main() {
 ios::sync_with_stdio ( false );
 cin.tie ( 0 );
    cin >> a[0] >> a[1] >> a[2];
    while (1) {
        if (a[0] == a[1] && a[1] == a[2]) {
            cout << -1 << endl;
            return 0;
        }
        if (a[0]%2 || a[1]%2 || a[2]%2) break;
        ll pa = a[0], pb = a[1], pc = a[2];
        a[0] = (pb+pc)/2;
        a[1] = (pa+pc)/2;
        a[2] = (pa+pb)/2;
        ans++;
    }   
    printf("%lld\n", ans);
    return 0;
}

Submission Info

Judge Result