UVA 10970 大块巧克力

简单题

#include <iostream>#include <sstream>#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <vector>#include <set>#include <cctype>#include <algorithm>#include <cmath>#include <deque>#include <map>using namespace std;///#define INF 0xffffff7#define MAXN 200 ///int M, N;int main(){///int i, j;int sum;while (cin >> M >> N){sum = 0;if (M == 1){sum = N - 1;cout << sum << endl;continue;}if (N == 1){sum = M - 1;cout << sum << endl;continue;}sum += M - 1;sum += M * (N - 1);cout << sum << endl;}    ///    return 0;}