hdu 5640 King's Cake（模拟）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5640

King's Cake

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 528    Accepted Submission(s): 421

Problem Description

It is the king's birthday before the military parade . The ministers prepared a rectangle cake of size  n×m(1≤n,m≤10000)  . The king plans to cut the cake himself. But he has a strange habit of cutting cakes. Each time, he will cut the rectangle cake into two pieces, one of which should be a square cake.. Since he loves squares , he will cut the biggest square cake. He will continue to do that until all the pieces are square. Now can you tell him how many pieces he can get when he finishes.

 

Input

The first line contains a number  T(T≤1000) , the number of the testcases.

For each testcase, the first line and the only line contains two positive numbers  n,m(1≤n,m≤10000) .

 

Output

For each testcase, print a single number as the answer.

 

Sample Input

   
   
   
   

    
    
    
    2
2 3
2 5
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    3
4

hint:
For the first testcase you can divide the into one cake of $2\times2$ , 2 cakes of $1\times 1$
   
   
   
   

 

Source

BestCoder Round #75

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5644  5643  5642  5641  5639 

题目大意：给一个n*m的蛋糕，每次只能切出一个正方形，输出最多能切多少个正方形。

解题思路：以最小边为基础，每次都切最小边那么大的正方形。。。以此类推

详见代码。

#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    int t;
    scanf("%d",&t);
    while (t--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        int ans=0;
        //int s=n*m;
        while(n!=0&&m!=0)
        {
            //s-=n*n;
            if (m>=n)
                m-=n;
            else
                n-=m;
            ans++;
        }
        //while (n>=m)
        //{
        //    n=-m;
        //    ans++;
        //}
        cout<<ans<<endl;
    }
    return 0;
}