UVA 10970 - Big Chocolate Shipu Ahamed - 01 Sep 2020 Problem PDFSolution:#include int main() { int m,n,c; while(scanf("%d%d",&m,&n)==2) printf("%d\n",m*n-1); return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10970/10970.cpp