virtual hust 2013.6.23 数学杂题基础题目 P - Big Chocolate
思路:很久之前写过,用递归一次一次的拆分的,写复杂了,直接输出m*n-1即可,证明自己想
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
#include <cstdio> #include <algorithm> #include <cstring> #include <iostream> #include <cmath> using namespace std; int main() { long long m,n; while(scanf("%lld%lld",&m,&n)!=EOF) { cout<<m*n-1<<endl; } return 0; }