Submission #1262721
Source Code Expand
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<int,string> pis;
double pi=3.1415926535898;
#define speed ios::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define lop(i,n) for(int i=0;i<int(n);i++)
#define rep(i,a,b) for(int i=a;i<=int(b);++i)
#define rng(i,a,b) for(int i=a;i>=int(b);i--)
#define ms(x,a) memset(x,a,sizeof(x))
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
#define pb push_back
#define r0 return 0;
#define CC continue;
#define bb(x) cerr<< x <<endl;
#define F first
#define S second // __builtin_popcount;
//freopen("output.txt","w",stdout),freopen("input.txt","r",stdin);
const ll M = 1e9+7 ;
const int N = 100100;
const int inf = INT_MAX;
const double eps = 1e-7;
////////////////////// Hi ^_^ hack me if you can :P
int main()
{
speed;
ll a,b,c;
cin >>a>>b>>c;
ll ans = 0;
while( !(a==b&&b==c) )
{
if(a&1) break;
if(b&1) break;
if(c&1) break;
ll aa,bb,cc;
aa = b/2 + c/2;
bb = a/2 + c/2;
cc = a/2 + b/2;
a = aa;
b = bb;
c = cc;
ans ++ ;
}
if ((a%2==0)&&(b%2==0)&&(c%2==0)&&a==b&&b==c) ans = -1;
cout << ans << endl;
}
/*
15 5 4
2
5
7
10
13
https://ideone.com/goT6Vy//http:
codeforces.com/problemset/problem/466/D
, vector < pair <int,int > >, greater <pair <int, int> >
http://codeforces.com/contest/295/submission/17929453
freopen("output.txt","w",stdout);
freopen("input.txt","r",stdin);
ll pwmod(ll a, ll n, ll mod)
{
ll ret = 1;
while (n)
{
if (n & 1) ret = ret * a % mod;
a = a * a % mod;
n >>= 1;
}
return ret;
}
for (int i=0; i<n; i++) Hi ^_^ hack me if you can :P
int mx[]= {0,0,1,-1, 1,1,-1,-1};
int my[]= {1,-1,0,0, 1,-1,1,-1};
bool inside (int i,int j){return (i>=0 && i<n && j>=0 && j<m);}
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void gcd(LL n,LL m,LL &d,LL &xx,LL &yy)
{
if(!m)
{
d=n;
xx=1;
yy=0;
}
else
{
gcd(m,n%m,d,yy,xx);
yy-=xx*(n/m);
}
}
int getm(int l,int r)
{
if(l>r)
return N;
if(l==r)
return 0;
if(l==r-1)
return s[l] != s[r];
if(s[l]==s[r])
return getm(l+1,r-1);
else
return 1+min(getm(l+1,r),getm(l,r-1));
}
int BIT[si], a[si], n;
void update(int x, int delta)
{
for(; x <= N; x += x&-x)
BIT[x] += delta;
}
int query(int x)
{
int sum = 0;
for(; x > 0; x -= x&-x)
sum += BIT[x];
return sum;
}
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define pr(x) printf("%d ",x)
#define prl(x) printf("%lld ",x)
#define prln(x) printf("%d\n",x)
#define prlln(x) printf("%lld\n",x)
#define scd(x) scanf("%lf",&x)
#define prd(x) printf("%.10f\n",x)
int n, a[N];
int seg[N<<2];
void build(int nd,int L,int R)
{
if( L == R )
{
seg[nd]=a[L];
return ;
}
int mid = (L+R) >>1;
build(nd<<1,L, mid);
build(nd<<1|1,mid+1,R);
seg[nd]=max( seg[nd<<1], seg[nd<<1|1] );
}
void update(int nd,int L,int R,int idx,int val)
{
if( L == R )
{
seg[nd]=val;
return ;
}
int mid = (L+R) >>1;
if( idx<=mid )
update(nd<<1, L,mid,idx,val);
else update(nd<<1|1,mid+1, R,idx,val);
seg[nd]=max( seg[nd<<1], seg[nd<<1|1] );
}
int query(int nd,int L,int R,int from,int to)
{
if( from<=L && R<=to )return seg[nd];
if( from>R || to<L )return -inf;
int mid = (L+R) >>1;
int leftAns = query(nd<<1, L,mid,from,to);
int rightAns= query(nd<<1|1,mid+1, R,from,to);
return max( leftAns,rightAns );
}
*/
Submission Info
Submission Time |
|
Task |
A - Cookie Exchanges |
User |
WaelAlJamal |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
4087 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample1.txt, sample2.txt, sample3.txt |
All |
sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name |
Status |
Exec Time |
Memory |
in1.txt |
AC |
1 ms |
256 KB |
in10.txt |
AC |
1 ms |
256 KB |
in11.txt |
AC |
1 ms |
256 KB |
in2.txt |
AC |
1 ms |
256 KB |
in3.txt |
AC |
1 ms |
256 KB |
in4.txt |
AC |
1 ms |
256 KB |
in5.txt |
AC |
1 ms |
256 KB |
in6.txt |
AC |
1 ms |
256 KB |
in7.txt |
AC |
1 ms |
256 KB |
in8.txt |
AC |
1 ms |
256 KB |
in9.txt |
AC |
1 ms |
256 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |