Answer to Question #17449 in C++ for Bishoy fam

Question #17449
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 M x N rectangle constructed from M x N unit-sized squares. You can assume that
Mohammad has also M x N 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 M x N
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 consists of several test cases. In each line of input, there are two integers 1 <= M <= 300,
the number of rows in the chocolate and 1 <= N <= 300, the number of columns in the chocolate. The
input should be processed until end of file is encountered.
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.
Expert's answer
Unfortunately, your question requires a lot of work and cannot be done for free.
Submit it with all requirements as an assignment to our control panel and we'll assist you.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!


No comments. Be the first!

Leave a comment

Ask Your question

New on Blog