UVA 10970 (13.08.07)

Problem G

Big Chocolate

Mohammadhas 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 BITstingy!), he could only afford buying one chocolate, albeit a very big one (partof it can be seen in figure 1) for all of them as a souvenir. Now, he wants togive each of his friends exactly one part of thischocolate and as he believes all human beings are equal (!), he wants to splitit into equal parts.

Thechocolate is an  rectangle constructedfrom unit-sized squares.You can assume that Mohammad has also friends waiting toreceive their piece of chocolate.

Tosplit the chocolate, Mohammad can cut it in vertical or horizontal direction (throughthe lines that separate the squares). Then, he should do the same with eachpart separately until he reaches unit size pieces ofchocolate. Unfortunately, because he is a little lazy, he wants to use the minimumnumber of cuts required to accomplish this task.

Yourgoal is to tell him the minimum number of cuts needed to split all of the chocolatesquares apart.

 

Figure 1. Mohammad’s chocolate

 

The Input

Theinput 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 beprocessed until end of file is encountered.

 

The Output

Foreach line of input, your program should produce one line of output containingan integer indicating the minimum number of cuts needed to split the entirechocolate into unit size pieces.

 

Sample Input

2 2

1 1

1 5

 

Sample Output

3

0

4

题意: 切巧克力, 切成大小为1的, 不过按这题的意思, 刀数只要 n*m-1即可....

AC代码:

#include<stdio.h>int main() {    int r, c;    while(scanf("%d %d", &r, &c) != EOF) {        int t = r * c;        printf("%d\n", t-1);    }    return 0;}