# SGU126-Boxes

### 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;
}


• 本文已收录于以下专栏：

## SGU126 Boxes

126. Boxes time limit per test: 0.5 sec.  memory limit per test: 4096 KB There are two boxes....

## sgu 135 + 184 +117+126+114+118+127

//sgu 135 #include #include #include using namespace std; #define LL long long LL n; int main() {...

## SGU 126 Boxes(模拟题|二进制)

F - Boxes Time Limit:250MS     Memory Limit:4096KB     64bit IO Format:%I64d & %I64u Su...

## 基于php+ajax+DHTML实现的dragable-boxes使得网站导更加个性化

• 2009-01-13 21:35
• 73KB
• 下载

## drawing boxes with metapost.pdf

• 2010-04-27 10:49
• 357KB
• 下载

## Docking boxes (dbx)

• 2012-05-16 17:49
• 71KB
• 下载

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)