UVA 10970 - Big Chocolate
Problem PDF
Solution:
#include
int main()
{
int m,n,c;
while(scanf("%d%d",&m,&n)==2)
printf("%d\n",m*n-1);
return 0;
}
#include
int main()
{
int m,n,c;
while(scanf("%d%d",&m,&n)==2)
printf("%d\n",m*n-1);
return 0;
}
