70分求助

#include<bits/stdc++.h>
using namespace std;
int dfs(int n,int m,int a){
	if(a == 0)return 0;
	return (n-a+1)*(m-a+1)+dfs(n,m,a-1);
}
int main(){
	unsigned long long r=0,c=0,n,m;
	cin>>n>>m;
	c=dfs(n,m,min(n,m));
	r=(m*(m+1)/2)*(n*(n+1)/2)-c;//公式巧算
	cout << c << " " << r;
	return 0;
}