SGU126-Boxes

原创 2013年12月02日 21:27:51

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...

SGU 333 AC源码

Windows 不能在 本地计算机 启动 SQL Server 服务 错误代码126

在使用SQL2005(或2008)是可能会遇到错误提示: “Windows 不能在 本地计算机 启动 SQL Server 。 有关更多信息,查阅系统事件日志。如果这是非 Microsof...

SGU103AC代码

drawing boxes with metapost.pdf

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

126. Word Ladder I & II

一、题目简述给定两个单词(beginWord和endWord),和一个单词字典,找到所有从beginWord到endWord的最短转换,使得: 每次只能改变一个字母; 每个转换单词都必须在单词字典中,...

Docking boxes (dbx)

  • 2012-05-16 17:49
  • 71KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)