Pagini recente » Cod sursa (job #163448) | Cod sursa (job #1168553) | Cod sursa (job #1687374) | Cod sursa (job #1871477) | Cod sursa (job #1182616)
#include <fstream>
using namespace std;
ifstream fin("dreptunghiuri.in");
ofstream fout("dreptunghiuri.out");
int n,m;
long long sol;
int cmmdc(int x, int y)
{
int r;
while(y)
{
r = x % y;
x = y;
y = r;
}
return x;
}
int main()
{
fin >> n >> m;
n--; m--;
sol = 1LL * n * (n+1) * m * (m+1) / 4;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if(cmmdc(i, j) == 1)
{
for(int k=1; k*i <= n && k*j <= m; k++)
{
for(int l=1; k*i + l*j <= n && k*j + l*i <= m; l++)
{
sol += (n - k*i - l*j + 1) * (m - k*j - l*i + 1);
}
}
}
}
}
fout << sol << '\n';
fout.close();
return 0;
}