组合数学C(n*m,3)-一条线的情况就好了
#include<cstdio>
#include<cstring>
#include<iostream>
#define LL long long
using namespace std;
LL ans,n,m;
LL gcd(LL a,LL b){return !b ? a : gcd(b,a%b);}
inline LL C(LL x){return x*(x-1)*(x-2)/6;}
int main(){
scanf("%lld%lld",&n,&m);n++,m++;
ans=C(n*m);
ans-=C(n)*m+C(m)*n;
for(int i=2;i<=n;i++){
for(int j=2;j<=m;j++){
ans-=(gcd(i-1,j-1)-1)*2*(n-i+1)*(m-j+1);
}
}
printf("%lld",ans);
return 0;
}