题解（中等长度）

#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int a = 0;
int e;
if(n < m){
e = n;
}else{
e = m;
}
for(int i = 1;i <= e;i++){
int hang = n - i + 1;
int lie = m - i + 1;
int k = hang * lie;
a = a + k;
}
cout << a << endl;
return 0;
}

好不容易写出来的，这个解法很基础