HDU 5640 King's Cake(贪心)
2016-03-29 16:46
127 查看
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
[align=left]Problem Description[/align]
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.
[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 numbers
n,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$
[align=left]Source[/align]
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; }
相关文章推荐
- 将MATLAB的变量数据导入到C/C++程序中的方法!
- java锁的种类以及辨析
- gitorious使用在ubuntu
- Ubuntu常用命令大全
- 浅谈《软件工程》
- Android SDK Manager 更新代理配置
- JS正则表达式及exec和match的区别
- regexp review
- PHP实现可自定义样式的分页类
- 再谈Mysql MHA
- 正向代理与反向代理的区别【Nginx读书笔记】
- 操作系统基础(一)
- leetcode_001
- [置顶] 多选记住复选框状态(分页)&存储过程批量更改状态
- nginx编译包报错:make: *** [install] Error 2
- Android 命令生成签名keystore、ant编译打包流程
- zabbix模板无法下载
- zabbix模板无法下载
- 闹钟制作
- javascript的时间事件