Pagini recente » Cod sursa (job #2659922) | Cod sursa (job #3162901) | Cod sursa (job #1984374) | Cod sursa (job #2289821) | Cod sursa (job #2478323)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin ("dreptunghiuri.in");
ofstream cout ("dreptunghiuri.out");
int n, m, cnt;
long long ans;
int rad[160005];
int main() {
cin >> n >> m;
// a / c = d / b => a * b = c * d, a + b = n, c + d = m
// n * a - a^2 = m * c - c^2
// c^2 - m * c + a * (n - a) = 0
for(int i = 1; i <= 160000; i++)
rad[i] = sqrt(i);
for(int i = 1; i < n; i++) {
for(int j = 1; j < m; j++) {
cnt = 1;
for(int a = 1; a < i; a++) {
int delta = j * j - 4 * a * (i - a);
if(delta == 0 && j % 2 == 0)
cnt++;
else {
if(delta > 0 && rad[delta] * rad[delta] == delta && (j + rad[delta]) % 2 == 0 && j > rad[delta])
cnt += 2;
}
}
ans += cnt * (n - i) * (m - j);
}
}
cout << ans;
return 0;
}