126. Boxes
time limit per test: 0.5 sec.
memory limit per test: 4096 KB
There are two boxes. There are A balls in the first box, and B balls in the second box (0 < A + B < 2147483648). It is possible to move balls from one box to another. From one box into another one should move as many balls as the other box already contains. You have to determine, whether it is possible to move all balls into one box.
Input
The first line contains two integers A and B, delimited by space.
Output
First line should contain the number N - the number of moves which are required to move all balls into one box, or -1 if it is impossible.
Sample Input
Sample Output
2 6
Sample Output
2
#include<iostream>
#include<cstring>
#include<cstdio>
#include<set>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#define inf 0xfffffff
#define CLR(a,b) memset((a),(b),sizeof((a)))
using namespace std;
int const nMax = 40000;
typedef long long LL;
typedef pair<LL,LL> pij;
LL gcd(LL a,LL b){
if(b==0)return a;
else return gcd(b,a%b);
}
LL a,b;
int main()
{
while(cin>>a>>b){
if(a>b)swap(a,b);
int ans=0;
if(a==0){
cout<<0<<endl;
break;
}
if((a+b)&1){
cout<<-1<<endl;
break;
}
while(a){
LL d=gcd(a,b);
if((a+b)/d%2==1){
cout<<-1<<endl;
return 0;
}
a/=d;
b/=d;
b-=a;
a+=a;
ans++;
if(a>b)swap(a,b);
}
cout<<ans<<endl;
}
return 0;
}