杭电5640之King's Cake

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$

题意：给你一个矩形的蛋糕，问你最多可以切成多少个正方形蛋糕，要求每块蛋糕尽可能大

思路：每次都沿着最小边切，取最大正方形

AC代码如下：
#include "stdio.h"

int main(int argc, char* argv[])
{
	int n,m,a,b,sum,temp,i;
	int N;
	scanf("%d",&N);
	while(N--)
	{
		a=0;
		sum=0;
		scanf("%d%d",&n,&m);
		if (n>m)
		{
			temp=n;
			n=m;
			m=temp;
		}
		for(i=0;;i++)
		{
			a=m/n;
			b=m%n;
			sum+=a;
			if (b==0)
				break;
			m=n;
			n=b;
		}
		printf("%d\n",sum);
	}
	return 0;
}