比赛--大巧克力问题--解题报告

本文详细解析了大巧克力问题的题意,并提供了一个简洁的C语言代码实现。通过样例分析,作者深入理解了如何将巧克力切割成等份,最终得出了一次切割所需的最小次数。此外,作者反思了自己的比赛经历,强调了多做题目和扎实基础的重要性。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

 

大巧克力问题

题目大意:

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.

 输入样例:

Sample Input

2 2

1 1

1 5

 

Sample Output

3

0

4

题目分析:

题目内容很多,但题目很简单,前面说了很多没用的东西。根据给出的样例分析,可以判断出一次只能将巧克力分成两块,所以切的次数a=M*N-1。

 

程序代码:

 1 #include<cstdio>
 2 #include<iostream>
 3 using namespace std;
 4 
 5 int M[300];
 6 int N[300];
 7 
 8 int main()
 9 {
10     int M,N,a;
11     while(scanf("%d%d",&M,&N)!=EOF)
12     {
13         a=M*N-1;
14         cout<<a<<endl;
15     }
16     return 0;
17 }

心得:

这道题目很简单,但由于比赛心情很烦躁,所以没有好好看这道题。比赛完后再看这道题才发现这道题原来如此简单。这次比赛我看到了和别人之间的差距,我应该多做一些题目,好好看一下C语言的基础知识。下次比赛要调整好自己的心态。

 

转载于:https://www.cnblogs.com/ttmj865/p/4655768.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值