Pagini recente » Cod sursa (job #2791805) | Cod sursa (job #3248492) | Cod sursa (job #1677097) | Cod sursa (job #1006138) | Cod sursa (job #1224227)
#include <fstream>
using namespace std;
int n,m;
long long result;
int cmmdc(int a, int b)
{
if (b == 0) return a;
return cmmdc(b, a % b);
}
int main()
{
ifstream f("dreptunghiuri.in");
ofstream g("dreptunghiuri.out");
f >> n >> m;
result = n * (n - 1) * m * (m - 1) / 4;
--n,--m;
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)
result += (n - k * i - l * j + 1) * (m - k * j - l * i + 1);
g << result << '\n';
return 0;
}