Submission #1262311

---

Source Code Expand

// today's dinosaur code is brought to you by: the letter t
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstring>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (int i=a;i<(int)(n);i++)
#define per(i,a,n) for (int i=(n)-1;i>=(int)(a);i--)
template<typename T> ostream& operator<<(ostream& s, vector<T> t) {rep(i, 0, t.size()) s << (i ? " " : "") << t[i]; return s;}
template<typename T> istream& operator>>(istream& s, vector<T> &t) {rep(i, 0, t.size()) s >> t[i]; return s;}
template<typename T, typename U> ostream& operator<<(ostream& s, pair<T, U> t) {s << "(" << t.first << "," << t.second << ")"; return s;}
template<typename T, typename U> istream& operator>>(istream& s, pair<T, U> &t) {s >> t.first >> t.second; return s;}
typedef long long ll;


int main() {
    ios_base::sync_with_stdio(false);
    ll a, b, c;
    cin >> a >> b >> c;
    
    
    rep(i, 0, 10000000) {
        if (a % 2 || b % 2 || c % 2) {
            cout << i << endl;
            return 0;
        }
        ll aa = (b + c) / 2;
        ll bb = (a + c) / 2;
        ll cc = (a + b) / 2;
        a = aa;
        b = bb;
        c = cc;
    }
    cout << -1 << endl;
}

Submission Info

Judge Result