Pagini recente » Cod sursa (job #3202644) | Cod sursa (job #2065893) | Cod sursa (job #1180379) | Cod sursa (job #1453740) | Cod sursa (job #2811399)
/// hhoangcpascal
#include <iostream>
#include <algorithm>
#include <cmath>
#define llong long long
using namespace std;
int m, n;
int main() {
ios_base::sync_with_stdio(0); cin.tie(NULL);
cin >> m >> n; --m, --n;
llong ans = 1LL * m * (m + 1) * n * (n + 1) / 4;
for(int h = 2; h <= m; ++h) {
llong add = 0;
for(int w = 2; w <= n; ++w)
for(int a = 1; a <= h / 2; ++a) {
int C = a * (h - a);
int delta = w * w - 4 * C;
if (delta < 0) continue;
if (delta == 0) {
add += m - w + 1;
if (a != h - a)
add += m - w + 1;
} else {
int s = sqrt(delta);
if (s * s < delta) continue;
if ((w + s) % 2 == 0) add += 2 * (m - w + 1);
}
}
ans += add * (n - h + 1);
}
cout << ans;
return 0;
}