# SGU126-Boxes

9170人阅读 评论(0)

### 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<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
int main()
{
int a,b;
int count;
while(scanf("%d%d",&a,&b)!=EOF)
{
count=0;
while(a&&b)
{
if(a>b)
swap(a,b);
b-=a;
a+=a;
count++;
if(count>64*64)
break;
}
if(count>(64*64))
printf("-1\n");
else
printf("%d\n",count);
}
return 0;
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：395350次
• 积分：6418
• 等级：
• 排名：第3750名
• 原创：240篇
• 转载：7篇
• 译文：0篇
• 评论：45条
文章分类