UVa 10970 Big Chocolate
找规律
include<cstdio>
using namespace std;
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)==2)
printf("%d\n",n*m-1);
return 0;
}
浙公网安备 33010602011771号