UVa Solution 10970 – Big Chocolate

The problem link is
 UVa:10970-Big Chocolate

Solution:

#include<stdio.h>
int main()
{
    long m,n;
    while(scanf("%ld %ld",&m,&n)==2)
    {
        printf("%ld\n",m*n-1);
    }
    return 0;
}

Run time: 0.036
User Name on UVA: refatsardar