zoukankan      html  css  js  c++  java
  • 给朋友分巧克力

    (慢慢看题目,O(∩_∩)O~)

    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.

     

    Figure 1. Mohammad’s chocolate

     

    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

    题目分析:
         通过对案例分析,分巧克力一次只能切一大块连着的,所以要切的次数刚好的rows*columns-1.

    源代码:

     1 #include<iostream>
     2 using namespace std;
     3 int main()
     4 {
     5         int N, M, sum = 0;               //定义行N,列M。
     6         while (cin >> N >> M)
     7         {
     8             sum = N*M;
     9             cout << sum - 1 << endl;
    10         }
    11     
    12     return 0;
    13 }

    心得:

    在VS的环境编程要加一句system("pause")暂停来看输入内容。有时候题目长不一定难做,仔细分析,慢慢就能得到思路。虽然在第一次比赛中没有拿到好名次,但是每天能学到东西,积累知识,就是一种收获,自己平时做得题目也没别人多,我想这是比赛做题目不顺手的主要原因吧!加油!↖(^ω^)↗

    ------------------------ 没有谁的人生不是斩棘前行 ---------------------------------------- JM
  • 相关阅读:
    堆模板
    二叉树输出
    中序+层次遍历输出前序
    扩展二叉树 (根据特殊的前序遍历建树)
    Leecode no.124 二叉树中的最大路径和
    JVM类加载过程
    Leecode no.208 实现Tire(前缀树)
    Leecode no.300 最长递增子序列
    volatile关键字深入解析 JMM与内存屏障
    Leecode no.200 岛屿数量
  • 原文地址:https://www.cnblogs.com/Lynn0814/p/4652417.html
Copyright © 2011-2022 走看看