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

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: