Submission #1996470

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#define INF 1000000000000
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;
using namespace std;

int main(){
	ll a, b, c;
	cin >> a >> b >> c;
	if(a == b && b == c && a%2 == 0) cout << -1 << endl;
	else{
		int ans = 0;
		while(a % 2 == 0 && b % 2 == 0 && c % 2 == 0){
			ll na = (b + c) / 2;
			ll nb = (a + c) / 2;
			ll nc = (a + b) / 2;
			a = na;
			b = nb;
			c = nc;
			ans++;
		}
		cout << ans << endl;
	}
	return 0;
}

Submission Info

Judge Result