HDU 5640 King's Cake
2016-03-13 15:49
288 查看
King's Cake
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 233 Accepted Submission(s): 190
[align=left]Problem Description[/align]
It is the king's birthday before the military parade . The ministers prepared a rectangle cake of sizen×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.
[align=left]Input[/align]
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 numbersn,m(1≤n,m≤10000).
[align=left]Output[/align]
For each testcase, print a single number as the answer.
[align=left]Sample Input[/align]
2 2 3 2 5
[align=left]Sample Output[/align]
3 4 hint: For the first testcase you can divide the into one cake of $2\times2$ , 2 cakes of $1\times 1$ [code]#include<iostream> using namespace std; int main(){ int t,i,j,n,m,s,k; while(cin>>t){ for(i=0;i<t;i++){ cin>>n>>m; k=0; s=n*m; while(n!=m){ if(n>m){ n-=m; } else{ m-=n; } k++; } cout<<k+1<<endl; } } return 0; }
[/code]
相关文章推荐
- 数据库查询
- 第二周学习进度
- 关于文档对象模型DOM的知识点
- 第三周项目-年龄几何
- DOS命令行下编译运行java文件
- JVM工作原理
- SpringMVC中四个基本注解
- shell-grep
- 在ZendStudio中增加新的php模板
- Java调用python,出现“无法解析的编译问题,PythonInterpreter无法解析为类型”
- W3C-表现层的世界
- zjut1554
- ngrok在linux和win下的使用
- Android-Sample1-NetWork
- 简单mysql连接池
- Spring注解详解
- poj 1742 Coins (动态规划,背包问题)
- poj刷题进度指南
- 【Java基础】IO总结
- 02.捕获未知异常