Pagini recente » Cod sursa (job #1170354) | Cod sursa (job #289908) | Cod sursa (job #1367039) | Cod sursa (job #2292268) | Cod sursa (job #1049094)
#include <fstream>
using namespace std;
ifstream fin("dreptunghiuri.in");
ofstream fout("dreptunghiuri.out");
int cmmdc(int a, int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
int n, m, i, j, k, l;
fin>>n>>m;
long long sol=1LL*(n-1)*n*(m-1)*m/4;
for(i=1;i<n;i++)
{
for(j=1;j<m;j++)
{
if(cmmdc(i, j)==1)
{
for(k=1;k*i<=n;k++)
{
for(l=1;i*k+l*j<n&&j*k+i*l<m;l++)
{
sol+=1LL*(n-i*k-j*l)*(m-j*k-i*l);
}
}
}
}
}
fout<<sol;
}