UVa 10970 Big Chocolate (think about AC)

Test instructions: Give you a m*n chocolate, let a person cut it into 1*1, but each time can only cut, ask how many knives to cut.

Analysis: Simple ah, I do not understand how so many people tle, not when the DP did it, in fact, No.

Suppose there is a 1*m chocolate, it is clear that the m-1 knife, then the n turn into 1, to n-1 knife, add up on OK.

The code is as follows:

#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <vector > #include <string> #include <algorithm>using namespace Std;int main () {    int n, m;    while (~SCANF ("%d%d", &n, &m)) {        printf ("%d\n", N-1 + N * (m-1));    }    return 0;}

UVa 10970 Big Chocolate (think about AC)