Pagini recente » Cod sursa (job #2668079) | Cod sursa (job #1057684) | Cod sursa (job #867537) | Cod sursa (job #691270) | Cod sursa (job #916415)
Cod sursa(job #916415)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("dreptunghiuri.in");
ofstream fout("dreptunghiuri.out");
int gcd (int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int N, M;
int main() {
fin >> N >> M;
long long rez = 0;
for (int i = 1; i < N; ++i)
for (int j = 0; j < M; ++j)
if (gcd(i, j) == 1)
for (int a = 1; a * i < N; ++a)
for (int b = 1; a * i + b * j < N && a * j + b * i < M; ++b)
rez += (N - (a * i + b * j)) * (M - (a * j + b * i));
fout << rez;
return 0;
}