Pagini recente » Cod sursa (job #189456) | Cod sursa (job #2272955) | Cod sursa (job #1984020) | Cod sursa (job #1448690) | Cod sursa (job #936796)
Cod sursa(job #936796)
#include <fstream>
#include <algorithm>
using namespace std;
int cmmdc(int a, int b)
{
if (b == 0) return a;
return cmmdc(b, a % b);
}
int N, M;
long long result;
int main()
{
ifstream fin("dreptunghiuri.in");
ofstream fout("dreptunghiuri.out");
fin >> N >> M;
result = 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 * i <= M; ++k)
for (int l = 1; k * i + l * j <= N && k * i + l * j <= M; ++l)
result += 1LL * (N - k * i - l * j) * (M - k * i - l * j);
fout << result << '\n';
fin.close();
fout.close();
}