UVA 10970(p79)----Big Chocolate

#include<bits/stdc++.h>using namespace std;int main(){    int n,m;    while(scanf("%d%d",&n,&m)!=EOF)    {        printf("%d\n",n*m-1);    }    return 0;}

题目地址：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1911

题解：答案为n*m-1