uva-10970-Big Chocolate

水题，找一下规律就行

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;


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

}