HDU 5640 King's Cake(贪心)

最新推荐文章于 2017-04-16 10:57:00 发布

原创最新推荐文章于 2017-04-16 10:57:00 发布 · 428 阅读

0 ·

CC 4.0 BY-SA版权

HDU 专栏收录该内容

85 篇文章

订阅专栏

本文探讨了一个有趣的算法问题：国王在庆祝生日时如何切割一个矩形蛋糕以获得尽可能多的正方形蛋糕块。通过使用贪心算法，我们提供了一种解决这个问题的方法，并给出了具体的实现代码。

King's Cake

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 827 Accepted Submission(s): 596

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

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

/*
贪心：对于长n,宽m,排序
1: n,m   +1;
2: max(m,n-m),min(m,n-m) +1;
3:  .... 
直到n==n-m; 
   最后再加一个剩下的 
*/
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int n,m; 
int main(){
    int t,re;
    cin>>t;
    while(t--){
    	re=1;
    	cin>>n>>m;
    	if(n==m){
    		cout<<re<<endl;
    		continue;
    	}
    	else if(n<m){
    		int tmp=n;
    		n=m;
    		m=tmp;
    	}
    	while(n!=m){
    		re++;
    		n=n-m;
			if(n<m){
    		int tmp=n;
    		n=m;
    		m=tmp;
    	}		
    	}
    	cout<<re<<endl;
    }
	return 0;
}