Submission #1592389

---

Source Code Expand

#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair

ll a, b, c;

map <pair <pii, int>, int> mapa;

int main() {
  cin >> a >> b >> c;

  int move = 0;
  while (!mapa[mp(mp(a, b), c)]) {
    mapa[mp(mp(a, b), c)] = 1;
    if (a % 2 || b % 2 || c % 2) {
      cout << move << endl;
      return 0;
    }
    ll na = a / 2;
    ll nb = b / 2;
    ll nc = c / 2;
    a = nb + nc;
    b = na + nc;
    c = na + nb;
    move++;
  }

  puts("-1");
  return 0;
}

Submission Info

Judge Result