UVA 10970 Big Chocolate

首先切min(n,m) - 1刀,这样就把巧克力分成了宽度为1的巧克力条,然后每条都切长度-1刀.

#include <iostream>
#include <cstdio>
using namespace std;
int n, m;

int main(){
	while(~scanf("%d%d", &n, &m)){
		int ans = min(n, m) - 1;
		ans += (max(n, m) - 1) * (ans + 1);
		printf("%d\n", ans);
	}
	return 0;
}