ACM Third Contest Big Chocolate

Problem G

Big Chocolate

Mohammad has recently visited Switzerland. As he loves he friends very much, he decided to buy some chocolate for them, but as this fine chocolate is very expensive (You know Mohammad are a little BIT stingy!), he could only afford buying one chocolate, albeit a very big one (part of it Can is seen in Figure 1) for all of them as a souvenir. Now, he wants to give each of its friends exactly one part of this chocolate and as he believes all human beings is equal (!), he wants to split it into equal parts.

The chocolate is a rectangle constructed from unit-sized squares. You can assume that Mohammad have 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 Squar ES). Then, he should does 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-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 all line of input, there is integers, the number of the rows in the chocolate and, the number of columns in the Cho Colate. The input should was 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

Program Analysis: This problem does not have much to say, is a piece of chocolate cut m*n block, can draw to solve, will make people feel very clear.

Program code:

#include <cstdio>#include<iostream>using namespacestd;intMain () {intA, b,t; while(SCANF ("%d%d", &a,&b)! =EOF) {  intn1,n2; N1= (A-1) +a* (b-1); N2= (b-1) +b* (A-1); T= (N1&LT;N2)?n1:n2; printf ("%d\n", T); }return 0;}

ACM Third Contest Big Chocolate