Pagini recente » Cod sursa (job #3296117) | Cod sursa (job #246921) | Cod sursa (job #27757) | Cod sursa (job #47401) | Cod sursa (job #1043749)
#include<cstdio>
#include<cmath>
using namespace std;
int N,M,A,B,C,D;
long long ras;
int main()
{
freopen("dreptunghiuri.in","r",stdin);
freopen("dreptunghiuri.out","w",stdout);
scanf("%d%d",&N,&M);
ras=1LL*N*(N-1)/2*M*(M-1)/2;
for(A=1;A<N;A++)
for(B=1;B+A+1<=N;B++)
for(C=1;C<M;C++)
if((A*B)%C==0)
{
D=(A*B)/C;
if(C+D<M) ras+=1LL*(N-A-B)*(M-C-D);
}
printf("%lld\n",ras);
return 0;
}