2015 HUAS Provincial Select Contest #1 D
2015-07-16 19:49
141 查看
题目:
Problem GBig Chocolate
Mohammad has recently visited Switzerland . As he loves his friends very much, he decided to buy some chocolate for them, but as this fine chocolate is very expensive(You know Mohammad is a little BIT stingy!), he could only afford buying one chocolate, albeit a very big one (part of it can be seen in figure 1) for all of them as a souvenir. Now, he wants to give each of his friends exactly one part of this chocolate and as he believes all human beings are equal (!), he wants to split it into equal parts.
The chocolate is an rectangle constructed from unit-sized squares. You can assume that Mohammad has also friends waiting to receive their piece of chocolate.
To split the chocolate, Mohammad can cut it in vertical or horizontal direction (through the lines that separate the squares). Then, he should do the same with each part separately until he reaches unit size pieces of chocolate. Unfortunately, because he is a little lazy, he wants to use the minimum number of cuts required to accomplish this task.
Your goal is to tell him the minimum number of cuts needed to split all of the chocolate squares apart.
The Input
The input consists of several test cases. In each line of input, there are two integers , the number of rows in the chocolate and , the number of columns in the chocolate. The input should be processed until end of file is encountered.
The Output
For each line of input, your program should produce one line of output containing an integer indicating the minimum number of cuts needed to split the entire chocolate into unit size pieces.
题目大意:有一块N*M的巧克力,你要把它平均分给N*M个人,求需要切至少多少次?
解题思路:直接切M*N-1刀。
代码:
#include<iostream> #include<cstdio> using namespace std; int main() { int M,N; while(cin>>N>>M) { if(N>=1&&N<=300&&M>=1&&M<=300) { printf("%d\n",(M*N)-1); } } return 0; }
相关文章推荐
- ]获取android应用的MD5签名
- 堆的应用!--求第k大数
- 【甘道夫】HBase基本数据操作详解【完整版,绝对精品】
- 【试水CAS-4.0.3】第03节_CAS服务端登录页添加验证码
- 特征选择
- 使用history.back()出现"警告: 网页已过期的解决办法"
- 如何在Myeclipse中添加插件?
- 国内外BaaS服务盘点
- Android学习2——Activity之间跳转
- JQuery显示隐藏一个按钮
- JS前端框架10 Extjs5 使用Tips
- 如何入侵目标的网络DIY指南
- 数据库锁
- Codeforces 474D Flowers (线性dp 找规律)
- 关于简历
- ACM进阶计划
- 关于mysql_connect CLIENT_MULTI_RESULTS
- LightOJ 1295 Lighting System Design (排序+dp)
- 浏览一个目录
- LightOJ1074 SPFA判负环