丙三醇

Stupid boy learn programming . QQ交流:792883735

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


 

 

 

 

 

阅读更多
个人分类: Simulation
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭