HDU
来源:互联网 发布:java项目上线流程 编辑:程序博客网 时间:2024/05/23 01:19
It is the king’s birthday before the military parade . The ministers prepared a rectangle cake of size
n×m(1≤n,m≤10000)
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)
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)
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
#include"stdio.h"int main(){ int n,chang,kuan,sum,i; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d",&kuan,&chang); sum=0; while(1) { if(chang>kuan) { sum++; chang=chang-kuan; } if(kuan>chang) { sum++; kuan=kuan-chang; } if(chang==kuan) { sum=sum++; break; } } printf("%d\n",sum); } return 0;}
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- 杭电oj2016_数据的交换输出
- 人性的弱点
- CSS选择器
- 二叉树的前序遍历
- ALEXNET解读
- HDU
- 蓝桥杯特殊回文数
- AC自动机
- 【Summary】——>Web组·Week2
- 在eclipse模拟器上运行下载好的apk程序与删除
- CodeForces
- xcrun: error: unable to find utility "instruments", not a developer tool or in PATH
- 【Git】Git撤销操作、删除文件和恢复文件
- 联想笔记本运行Android Studio 时启动不了自带模拟器问题