Submission #1265869

---

Source Code Expand

#include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<utility>
#include<memory>
#include<cmath>
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define pb push_back

using namespace std;
 
typedef long long ll;
typedef pair<int,int> P;
const int mod=1e9+7,INF=1<<30;
const double EPS=1e-12,PI=3.1415926535897932384626;
const int MAX_N=10001;

int calc(int n){
  int res=0;
  if(n%2){
    return 0;
  }else{
    return calc(n/2)+1;
  }
}

int main(){
  int A[3],a[3];
  cin >> A[0] >> A[1] >> A[2] ;
  if(A[0]%2 && A[1]%2 && A[2]%2){
    cout << "0" << endl;
    return 0;
  }
  int ans=-1;
  rep(i,30){
    //cout << A[0]<<" "<<A[1]<<" "<<A[2] << endl;
    int a[3];
    rep(j,3) a[j]=A[j]>>i;
    if((a[0]&1 && a[1]&1 && a[2]&1)||((~a[0]&1)&&(~a[1]&1)&&(~a[2]&1))){
      continue;
    }else{
      ans=i;
      break;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result