Pagini recente » Cod sursa (job #2156679) | Cod sursa (job #2961090) | Cod sursa (job #1335957) | Cod sursa (job #2287595) | Cod sursa (job #921153)
Cod sursa(job #921153)
#include<fstream>
using namespace std;
long long i,j,x,y,a,b,n,s;
int gcd(int x,int y)
{
int r;
while (y>0)
{
r=x%y;
x=y;
y=r;
}
return x;
}
int main()
{
ifstream f("dreptunghiuri.in");
ofstream g("dreptunghiuri.out");
f >> x >> y;
for (i=1;i<=x;i++)
for (j=0;j<=y;j++)
if (gcd(i,j)==1)
for (a=1;a*i<=x;a++)
for (b=1;(a*i+b*j<=x) && (a*j+b*i<=y);b++)
s+=(x-a*i-b*j)*(y-a*j-b*i);
g << s;
return 0;
}