ACM第三次比赛 Big Chocolate

Problem G

Big 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.

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

程序分析：此题并没有太多好说的，就是把一块巧克力切M*N块，可以画图来解决，会让人感觉很清楚的。

程序代码：

#include <cstdio>
#include <iostream>
using namespace std;

int main( )
{int a ,b,t;
while(scanf("%d %d",&a,&b)!=EOF)
{
  int n1,n2;
         n1=(a-1)+a*(b-1);
        n2=(b-1)+b*(a-1);
    t=(n1<n2)?n1:n2;
        printf("%d\n",t);
    }


return 0;
}

ACM第三次比赛 Big Chocolate

原文：http://www.cnblogs.com/yilihua/p/4655739.html